Answers are grounded in this paper and cite their sources.
This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.
No takes yet. Share an insight, caveat, or question.
Nagano et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: