论文信息 - Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem - 字舞流文

Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem

Wojciech Bozejko | Mieczyslaw Wodecki | Jaroslaw Pempera | Mariusz Uchronski | J. Pempera | W. Bożejko | M. Wodecki | Mariusz Uchroński

[1] Mieczysław Wodecki. A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem , 2008 .

[2] L. V. Wassenhove,et al. Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[3] Wojciech Bozejko,et al. Block approach - tabu search algorithm for single machine total weighted tardiness problem , 2006, Comput. Ind. Eng..

[4] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[5] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .

[6] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[7] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[8] Mieczysław Wodecki. A block approach to earliness-tardiness scheduling problems , 2009 .

[9] Robert L. Bulfin,et al. Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .

[10] Stefan Voß,et al. Tabu Search: Applications and Prospects , 1993 .

[11] Ceyda Oguz,et al. A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..