论文信息 - On-line and semi-online scheduling for flow shop problems on two machines

On-line and semi-online scheduling for flow shop problems on two machines

We investigate the on-line and semi-online scheduling for flow shop problems on two machines with the objective to minimize the makespan. Several lower bounds for the problems with and without preemption are derived. For some special cases of semi-online version, we provide two on-line algorithms with a competitive ratio of . Finally we give a lower bound for the problem with unavailable time interval on the first machine. And for the problem with the interval on the second machine, we show that no on-line algorithm has a constant competitive ratio.

Ming Yang | Xiwen Lu

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

[2] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .

[3] Chengbin Chu,et al. A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[4] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[5] Chung-Yee Lee,et al. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

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

[7] Chris N. Potts,et al. Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

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

[9] C. N. Potts. Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates , 1985, Math. Oper. Res..