Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 49, Issue 21, Pages 6273-6286Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2010.531775
Keywords
scheduling; flow-shop; no-wait; non-availability; branch-and-bound algorithm
Ask authors/readers for more resources
In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.
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