A hybrid genetic algorithm for no-wait job shop scheduling problems
暂无分享,去创建一个
[1] C. V. Ramamoorthy,et al. A Scheduling Problem , 1973 .
[2] Han Hoogeveen,et al. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..
[3] Abraham P. Punnen,et al. The traveling salesman problem and its variations , 2007 .
[4] Chelliah Sriskandarajah,et al. The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .
[5] Sartaj Sahni,et al. Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..
[6] R. Macchiaroli,et al. Design and implementation of a tabu search algorithm to solve the no-wait job-shop scheduling problem , 1996 .
[7] Chelliah Sriskandarajah,et al. Some no-wait shops scheduling problems: Complexity aspect , 1986 .
[8] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[9] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[10] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[11] David S. Johnson,et al. Experimental Analysis of Heuristics for the STSP , 2007 .
[12] W. Kubiak. A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem , 1989 .
[13] Dario Pacciarelli,et al. Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..
[14] Carlos A. Brizuela,et al. No-wait and blocking job-shops: challenging problems for GA's , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).
[15] Albert Jones,et al. Survey of Job Shop Scheduling Techniques , 1999 .
[16] S. K. Goyal. Job-shop sequencing problem with no wait in process , 1975 .
[17] Yasuhiro Tsujimura,et al. A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .
[18] G. Laporte. The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .
[19] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[20] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[21] John J. Grefenstette,et al. How Genetic Algorithms Work: A Critical Look at Implicit Parallelism , 1989, ICGA.