Abstract This paper considers new flowshop scheduling problems related to automated manufacturing systems in which n jobs are processed on two machines Ma and Mb in this order. The job transportation between two machines is done by a single automated guided vehicle (AGV), and is crucial because no machine has buffer storage for work-in-process (WIP) and hence a machine cannot release a finished job until the empty AGV becomes available at that machine, while the AGV cannot transfer an unfinished job to a machine until the machine is empty. O(n 3) algorithms are given in this paper to find optimal sequences of n jobs that minimize their maximum completion time (i.e., makespan). Some numerical results are also given to evaluate the effect of computing optimal sequences.
[1]
S. M. Johnson,et al.
Optimal two- and three-stage production schedules with setup times included
,
1954
.
[2]
R. Gomory,et al.
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
,
1964
.
[3]
C. V. Ramamoorthy,et al.
On the Flow-Shop Sequencing Problem with No Wait in Process †
,
1972
.
[4]
Christos H. Papadimitriou,et al.
Flowshop scheduling with limited temporary storage
,
1980,
JACM.
[5]
John A. Schey,et al.
Introduction to manufacturing processes
,
1977
.