Benchmarks for basic scheduling problems

European Journal of Operational Research - Tập 64 Số 2 - Trang 278-285 - 1993
Éric D. Taillard1
1École Polytechnique Fédérale de Lausanne, Département de Mathématiques, CH-1015 Lausanne, Switzerland

Tóm tắt

Từ khóa


Tài liệu tham khảo

Applegate, 1991, A computational study of the job-shop scheduling problem, ORSA Journal on Computing, 3, 149, 10.1287/ijoc.3.2.149

Beasley, 1990, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society, 41, 1069, 10.1057/jors.1990.166

Bräsel, 1991, Constructive heuristic algorithms for the open shop problem, 21/91

Bratley, 1983

Carlier, 1984, Problèmes d'ordonnancement à contraintes de ressources: Algorithmes et complexité

Carlier, 1989, An algorithm for solving the job-shop problem, Management Science, 35/2, 164, 10.1287/mnsc.35.2.164

Glover, 1989, Tabu Search - Part I, ORSA Journal on Computing, 1, 190, 10.1287/ijoc.1.3.190

Kleinau, 1991, On some new methods for solving machine scheduling problems, 16/91

Lawler, 1989, Sequencing and scheduling

Lawrence, 1982

Muth, 1963, Industrial scheduling, 225

Taillard, 1989, Parallel taboo search technique for the job shop scheduling problem

Taillard, 1990, Some efficient heuristic methods for the flowshop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X

Widmer, 1989, A new heuristic for the flowshop sequencing problem, European Journal of Operational Research, 41, 186, 10.1016/0377-2217(89)90383-4