Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 40, Issue 17, Pages 4353-4380Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540210159536
Keywords
-
Ask authors/readers for more resources
We treat the n-job, two-stage hybrid flowshop problem with one machine in the first stage and two different machines in parallel in the second stage. The objective is to minimize the makespan. We demonstrate that the problem is NP-complete. We formulate a dynamic program, which is beyond our grasp for problems of more than 15 jobs. Our search for heuristic approaches led to the adoption of the Johnson sequence, which motivated two of the three approaches: dynamic programming and sequence-and-merge. The third approach, the greedy heuristic, was included as example of an elementary heuristic.
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