Scheduling of a two-machine flowshop with travel time between machines

The paper considers 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 complete 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.