摘要
This paper presents a multi-start simulated annealing with bi-directional shift timetabling (MSA-BST) algorithm for solving the no-wait jobshop scheduling problem (NWJSP). To enhance the quality of the solution, a bi-directional shift timetabling procedure that allows delay timetabling and consequently enlarges the search space is embedded into the multi-start simulated annealing algorithm. The performance of the proposed MSA-BST algorithm is evaluated with respect to the makespan by comparing its computational results to those of the best-to-date meta-heuristic algorithm, the hybrid artificial bee colony (HABC) algorithm, in the literature. Experimental results that were obtained by applying the proposed algorithm to a set of benchmark problems in the literature indicate that it significantly outperforms HABC. The main contribution of this study is to provide a novel and effective alternative method for solving the complex NWJSP.
学科与关键词
- Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristicYing, Kuo-Ching; Lin, Shih-Wei*COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169: 108238.被引 11
- A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problemValenzuela-Alcaraz, Victor M.; Cosio-Leon, M. A.; Danisa Romero-Ocano, A.; Brizuela, Carlos A.*EXPERT SYSTEMS WITH APPLICATIONS, 2022, 194: 116498.被引 10
- MINIMIZING TOTAL FLOW TIME IN PERMUTATION FLOWSHOP ENVIRONMENTLin, Shih-Wei; Huang, Chien-Yi; Lu, Chung-Cheng; Yng, Kuo-Ching*International Journal of Innovative Computing, Information and Control, 2012, 8(10A): 6599-6612.被引 5
