Online scheduling of ordered flow shops

Abstract We consider online as well as offline scheduling of ordered flow shops with the makespan as objective. In an online flow shop scheduling problem, jobs are revealed to a decisionmaker one by one going down a list. When a job is revealed to the decision maker, its operations have to be scheduled irrevocably without having any information regarding jobs that will be revealed afterwards. We consider for the online setting the so-called Greedy Algorithm which generates permutation schedules in which the jobs on the machines are at all times processed without any unnecessary delays. We focus on ordered flow shops, in particular proportionate flow shops with different speeds and proportionate flow shops with different setup times. We analyze the competitive ratio of the Greedy Algorithm for such flow shops in the online setting. For several cases, we derive lower bounds on the competitive ratios.

[1]  Han Hoogeveen,et al.  The three-machine proportionate flow shop problem with unequal machine speeds , 2003, Oper. Res. Lett..

[2]  Byung-Cheon Choi,et al.  Flow shops with machine maintenance: Ordered and proportionate cases , 2010, Eur. J. Oper. Res..

[3]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[4]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[5]  Mehmet Savsar,et al.  Stochastic proportionate flowshop scheduling with setups , 2001 .

[6]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[7]  I. Hamilton Emmons,et al.  Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .

[8]  Gerhard J. Woeginger,et al.  A STUDY OF ON-LINE SCHEDULING TWO-STAGE SHOPS· , 1995 .

[9]  Herbert Hamers,et al.  Proportionate flow shop games , 2006, J. Sched..

[10]  Ming Yang,et al.  On-line and semi-online scheduling for flow shop problems on two machines , 2013 .

[11]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[12]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[13]  S. S. Panwalkar,et al.  Sequencing Research and the Industrial Scheduling Problem , 1973 .

[14]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[15]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .