A Metaheuristic for No-wait Flowshops with Variable Processing Times

Hybrid Algorithm Based on Genetic Simulated Annealing Algorithm for Complex Multiproduct Scheduling Problem with Zero-Wait Constraint

“…Dong [19] introduced the no-wait two-stage flow-shop scheduling problem with the first stage machine having multitask flexibility motivated by a real-world scenario in hospitals. Xu [20] proposed a metaheuristic, self-adaptive memetic algorithm (SAMA for short) for no-wait flow shop with variable processing times and used the evolutionary operators to adaptively control the balance between intensification and diversification of the algorithm. Ying [21] presented a multistart SA with bidirectional shift timetabling (MSA-BST) algorithm for solving the NWJSP.…”

“…Finally, the conclusions of this paper and future research work are given. [14] Flexible job shop Makespan and total setup time NSGAII Huang [15] Flexible job shop Makespan GA Wang [18] Dynamic job shop Makespan PSO Nagano [8] No-wait flow shop Makespan Iterated greedy algorithm Ali [11] No-wait flow shop Total tardiness SA Yüksel [16] No-wait permutation flow shop Total tardiness and energy consumption ABC and NSGAII Wu [17] No-wait permutation flow shop Makespan and energy consumption Multiobjective VNS Dong [19] No-wait two-stage flow shop Makespan Linear-time combinatorial algorithm Xu [20] No-wait permutation flow shop Makespan Self-adaptive memetic algorithm Ying [3,21,30] No-wait job shop Makespan Multistart SA Deng [22] No-wait job shop Total flow time Iterated greedy algorithm Shi [7] Assembly job shop Makespan GA Lei [23] Integrated scheduling problem Makespan GA Zhao [29] Integrated scheduling problem Makespan GA…”