A MODULAR SIMULATED ANNEALING ALGORITHM FOR MULTI- AGENT SYSTEMS: A JOB-SHOP SCHEDULING APPLIACTION
暂无分享,去创建一个
[1] Michael Kolonko,et al. Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..
[2] Katsuhiko Takahashi,et al. Simulated annealing approach for minimizing the makespan of the general job-shop , 1999 .
[3] Ben Paechter,et al. A scalable and robust framework for distributed applications , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[4] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[5] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..
[6] C.K. Wong,et al. Fast parallel heuristics for the job shop scheduling problem , 2002, Comput. Oper. Res..
[7] Jeng-Shyang Pan,et al. Vector quantization based on genetic simulated annealing , 2001, Signal Process..
[8] T.C. Fogarty,et al. A Distributed Resource Evolutionary Algorithm Machine (DREAM) , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[9] C.K. Wong,et al. Two simulated annealing-based heuristics for the job shop scheduling problem , 1999, Eur. J. Oper. Res..
[10] Ling Wang,et al. An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..
[11] Ju-Jang Lee,et al. Adaptive simulated annealing genetic algorithm for system identification , 1996 .
[12] Suzannah Yin Wa Wong,et al. Hybrid simulated annealing/genetic algorithm approach to short-term hydro-thermal scheduling with multiple thermal plants , 2001 .