An effective heuristic for no-wait flow shop production to minimize makespan. (July 2016)

• Record Type: Journal Article
• Authors: Ye, Honghan; Li, Wei; Miao, Enming
• Is Part Of: Journal of manufacturing systems. Volume 40(2016)Part 2
• Page Start: 2
• Page End: 7
• Publication Date: 2016-07
• Subjects: Makespan minimization -- No-wait flow shop -- Heuristics -- Computational complexity; Manufacturing processes -- Periodicals; Production engineering -- Data processing -- Periodicals; Robots, Industrial -- Periodicals; Production, Technique de la -- Informatique -- Périodiques; Robots industriels -- Périodiques; Electronic journals; 670.42
• DOI: 10.1016/j.jmsy.2016.05.001
• Languages: English
• ISSNs: 0278-6125

Abstract

Abstract: In no-wait flow shop production, each job must be processed without any interruption from its start time on the first machine to its completion time on the last machine. To minimize makespan in no-wait flow shop production is one of the main concerns in industry. In this paper, we propose an average departure time (ADT) heuristic for minimizing makespan in no-wait flow shop production. Based on the computational experiment with a large number of instances of various sizes, the ADT heuristic performs better than three existing best-known heuristics in the same computational complexity environment.