论文信息 - Scheduling of a Two-machine Flowshop with Travel Time Between Machines

Scheduling of a Two-machine Flowshop with Travel Time Between Machines

We consider the classical two-machine flowshop sequencing problem with the following additional constraint. When a job is completed on the first machine it must be transported to the second machine; a single transporter is available. A completed job on the first machine will block the machine if the transporter is in transit. A constructive algorithm to minimize makespan is presented in the paper.

S. S. Panwalkar | S. Panwalkar

[1] Kathryn E. Stecke,et al. Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems , 1983 .

[2] C. V. Ramamoorthy,et al. A Scheduling Problem , 1973 .

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

[4] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[5] Alessandro Agnetis,et al. Optimal two-machine scheduling in a flexible flow system , 1990, [1990] Proceedings. Rensselaer's Second International Conference on Computer Integrated Manufacturing.

[6] P. L. Maggu,et al. ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES , 1981 .

[7] Kathryn E. Stecke,et al. Loading and control policies for a flexible manufacturing system , 1981 .

[8] Kathryn E. Stecke,et al. Performance evaluation for systems of pooled machines of unequal sizes: Unbalancing versus balancing , 1989 .

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