Soper, Alan J. ORCID: 0000-0002-0901-9803 (2015) A cyclical search for the two machine flow shop and open shop to minimise finishing time. Journal of Scheduling, 18 (3). pp. 311-314. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-013-0356-7)

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Article
Additional Information:	[1] First published online: 5 November 2013.
Uncontrolled Keywords:	flow shop, open shop, minimum makespan
Subjects:	Q Science > QA Mathematics
Faculty / School / Research Centre / Research Group:	Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Related URLs:	Publisher Organisation
Last Modified:	09 Sep 2019 15:20
URI:	http://gala.gre.ac.uk/id/eprint/10167

Actions (login required)

View Item