A simulated annealing approach to job shop scheduling using critical block transition operators
暂无分享,去创建一个
[1] B. Rosen,et al. Function Optimization Based On Advanced Simulated Annealing , 1992, Workshop on Physics and Computation.
[2] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[3] Takeshi Yamada,et al. A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.
[4] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..
[5] S. S. Panwalkar,et al. A Survey of Scheduling Rules , 1977, Oper. Res..
[6] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[7] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[8] E. Nowicki,et al. A block approach for single-machine scheduling with release dates and due dates , 1986 .
[9] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[10] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[11] Takeshi Yamada,et al. Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.
[12] Bruce E. Rosen,et al. Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .