Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 99, Issue 1-2, Pages 4-15Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2004.12.002
Keywords
shop scheduling; availability constraints; geometric approach
Ask authors/readers for more resources
This paper addresses the flow shop scheduling problem with limited machine availability. In such a problem, n jobs has to be scheduled on m machines under the makespan criterion and under the assumption that the machines are not available during the whole planning horizon. Since the makespan minimization is strongly NP-hard, we propose a heuristic approach to approximately solve the problem that consists in scheduling the jobs two by two according to an input sequence, and using a polynomial algorithm. This algorithm is an extension of the geometric approach developed for the two-job shop scheduling problem. (c) 2005 Elsevier B.V. All rights reserved.
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