An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
暂无分享,去创建一个
[1] James K. Weeks. A Simulation Study of Predictable Due-Dates , 1979 .
[2] Kenneth R. Baker,et al. Job shop scheduling with modified due dates , 1983 .
[3] Taeyong Yang,et al. A MULTIPLE-PASS HEURISTIC RULE FOR JOB-SHOP SCHEDULING WITH DUE-DATES , 1993 .
[4] Kuei-Bin Wu,et al. An improved simulated annealing for facility layout problems in cellular manufacturing systems , 1998 .
[5] Rob A. Rutenbar,et al. Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.
[6] Wen-Chyuan Chiang,et al. Simulated annealing for machine layout problems in the presence of zoning constraints , 1992 .
[7] Kenneth R. Baker,et al. Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .
[8] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[9] M. Pirlot. General local search methods , 1996 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[12] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[13] Chandrasekharan Rajendran,et al. Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .
[14] Edward Anderson,et al. Two new rules to minimize tardiness in a job shop , 1990 .
[15] Richard W. Eglese,et al. Simulated annealing: A tool for operational research , 1990 .