A cyclical search for the two machine flow shop and open shop to minimise finishing time
- 255 Downloads
This paper considers scheduling problems on two machines to minimise the makespan. It shows that a simple cyclical search can find a flow shop schedule with one job omitted with makespan less than or equal to the maximum of the total processing time of all jobs on either machine. This flow shop schedule is used as the basis for constructing a number of schedules with minimum makespan for the two machine open shop. The search may be applied unchanged to batches of jobs to provide more optimal schedules.
KeywordsFlow shop Open shop Minimum makespan
The author is grateful for the comments of the reviewer for helping to improve the presentation of this manuscript.
- de Werra, D. (1989). Graph-theoretical models for preemptive scheduling. In R. Slowinski & J. Weglarz (Eds.), Advances in project scheduling (pp. 171–185). Amsterdam: Elsevier.Google Scholar
- Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. J Assoc Comput Mach, 23, 665–679. Google Scholar
- Gribkovskaia, I. V., Lee, C.-Y., Strusevich, V. A., & de Werra, D. (2006). Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper Res Lett, 34, 459–464.Google Scholar