A simulated annealing algorithm for the hybrid flow shop scheduling to minimize the number of tardy jobs
SHUAI Tianping1,*,YU Jinguo1,SUN Ling2
1. Beijing University of Posts and Telecommunications, Beijing 100876, China 2. Information Department, Shougang Automation and Information Technology CO., LTD, Beijing 100042, China
SHUAI Tianping,YU Jinguo,SUN Ling. A simulated annealing algorithm for the hybrid flow shop scheduling to minimize the number of tardy jobs[J]. Operations Research Transactions, 2013, 17(2): 41-47.
Soroush H M. Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem [J]. European Journal of Operational Research, 2007, 181: 266-287. Hallah M R, Bulfin R L. Minimizing the weighted number of tardy jobs on parallel processors [J]. European Journal of Operational Research, 2005, 160: 471-484. 王凌. 智能优化算法及其应用 [M]. 北京: 清华大学出版社, 2001. Ho J C, Chang Y L. Minimizing the number of tardy jobs for m parallel machines [J]. European Journal of Operational Research, 1995, 84: 343-355. Gupta J N D, Alex J R-T. Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs [J]. European Journal of Operational Research, 2005, 167: 679-695. Jozefowska J, Mika M. Local search meta-heuristics for discrete continuous scheduling problems [J]. European Journal of Operational Research, 1998, 107: 354-370.