Makespan minimization for flow-shop problems with transportation times and a single robot

In a flow-shop problem with transportation times and a single robot n jobs consisting of m operations have to be processed in the same order on m machines. Additionally, transportation times are considered if a job changes from one machine to another. We assume that unlimited buffer space exists between the machines and all transportations have to be done by a single robot. The objective is to determine a feasible schedule with minimal makespan. New complexity results are derived for special cases where the processing or transportation times are constant values. Some of these may also be interpreted as new results for special cases of the classical 3-machine flow-shop F3||Cmax with constant processing times at certain stages.

[1]  Konstantin Kogan,et al.  Scheduling a two-machine robotic cell: A solvable case , 1995, Ann. Oper. Res..

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

[3]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[4]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[5]  Helman I. Stern,et al.  Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .

[6]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[7]  Wenci Yu,et al.  The two-machine flow shop problem with delays and the one-machine total tardiness problem , 1996 .

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  Toshihide Ibaraki,et al.  Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .

[10]  Yves Crama,et al.  Cyclic Scheduling of Identical Parts in a Robotic Cell , 1997, Oper. Res..

[11]  Chelliah Sriskandarajah,et al.  Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..

[12]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  Wieslaw Kubiak,et al.  Sequencing of parts and robot moves in a robotic cell , 1989 .

[15]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[16]  L. G. Mitten.  Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[17]  Hiroshi Kise,et al.  ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .