Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 52, Issue 1, Pages 116-121Publisher
NATURE PUBLISHING GROUP
DOI: 10.1057/palgrave.jors.2601025
Keywords
scheduling; flow shop; complexity; heuristics
Ask authors/readers for more resources
The scheduling problems studied in this paper concern a two-machine no-wait flow shop problem with limited machine availability. In this model, we assume that machines may not always be available, far example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in advance. The objective function considered is the maximum completion time (C-max). we prove that the problem is NP-hard even if only one nonavailability period occurs an one of machines, and NP-hard in the strong sense for arbitrary numbers of non-availability periods. We also provide heuristic algorithms with error bounding analysis.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available