Answers are grounded in this paper and cite their sources.
In this paper, a two-stage no-wait hybrid flow-shop scheduling problem is investigated in which the sequence-dependent setup time at the first stage is considered. The NP-hardness of the problem is first proven. A lower bound based on the Hungarian method is proposed. A branch-and-bound approach, a tabu search and three heuristic methods are developed for the problem. Extensive computational experiments are conducted to evaluate the performance of these methods. The computational results show the efficiency of the proposed methods.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: