Heuristic for Stochastic Online Flowshop Problem with Preemption Penalties

Abstract EN

The deterministic flowshop model is one of the most widely studied problems; whereas its stochastic equivalent has remained a challenge.

Furthermore, the preemptive online stochastic flowshop problem has received much less attention, and most of the previous researches have considered a nonpreemptive version.

Moreover, little attention has been devoted to the problems where a certain time penalty is incurred when preemption is allowed.

This paper examines the preemptive stochastic online flowshop with the objective of minimizing the expected makespan.

All the jobs arrive overtime, which means that the existence and the parameters of each job are unknown until its release date.

The processing time of the jobs is stochastic and actual processing time is unknown until completion of the job.

A heuristic procedure for this problem is presented, which is applicable whenever the job processing times are characterized by their means and standard deviation.

The performance of the proposed heuristic method is explored using some numerical examples.