A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness
暂无分享,去创建一个
[1] Rajan Batta,et al. Scheduling larger job shops: a decomposition approach , 1996 .
[2] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[3] Robert H. Storer,et al. A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness , 1999, Oper. Res..
[4] Erhan Kozan,et al. Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model , 2011, Transp. Sci..
[5] Warren W. Fisher,et al. Due Date Assignment, Job Order Release, and Sequencing Interaction in Job Shop Scheduling* , 1992 .
[6] D Sculli. Priority dispatching rules in job shops with assembly operations and random delays , 1980 .
[7] Egon Balas,et al. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .
[8] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[9] Kenneth R. Baker,et al. Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .
[10] Mario Vanhoucke,et al. A hybrid single and dual population search procedure for the job shop scheduling problem , 2011, Eur. J. Oper. Res..
[11] S. S. Panwalkar,et al. A Survey of Scheduling Rules , 1977, Oper. Res..
[12] V. Vinod,et al. Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study , 2008 .
[13] Erwin Pesch,et al. Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..
[14] Rui Zhang,et al. A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective , 2011, Comput. Oper. Res..
[15] Jack C. Hayya,et al. Priority dispatching with operation due dates in a job shop , 1982 .
[16] Tarık Çakar,et al. Parallel Robot Scheduling to Minimize Mean Tardiness with Unequal Release Date and Precedence Constraints Using a Hybrid Intelligent System , 2012 .
[17] Ranga V. Ramasesh. Dynamic job shop scheduling: A survey of simulation research , 1990 .
[18] Matthew H. Bassett,et al. Decomposition techniques for the solution of large-scale scheduling problems , 1996 .
[19] Rui Zhang,et al. A two-stage hybrid particle swarm optimization algorithm for the stochastic job shop scheduling problem , 2012, Knowl. Based Syst..
[20] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[21] Toàn Phan-Huy. Constraint Propagation in Flexible Manufacturing , 2000 .
[22] Christos D. Tarantilis,et al. A hybrid evolutionary algorithm for the job shop scheduling problem , 2009, J. Oper. Res. Soc..
[23] Erhan Kozan,et al. A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem , 2012, J. Oper. Res. Soc..
[24] Jeffrey B. Sidney,et al. Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..
[25] Ihsan Sabuncuoglu,et al. Operation-based flowtime estimation in a dynamic job shop , 2002 .
[26] Peigen Li,et al. A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..
[27] Marcos Singer,et al. Decomposition methods for large job shops , 2001, Comput. Oper. Res..
[28] H. L. Ong,et al. A modified tabu search algorithm for cost-based job shop problem , 2010, J. Oper. Res. Soc..