BENCHMARKS FOR BASIC SCHEDULING PROBLEMS

被引：1663

作者：

TAILLARD, E

机构：

[1] École Polytechnique Fédérale de Lausanne, Département de Mathématiques

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 64卷 / 02期

关键词：

COMBINATORIAL OPTIMIZATION; SCHEDULING; BENCHMARKS;

D O I：

10.1016/0377-2217(93)90182-M

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we propose 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are: the permutation flow shop, the job shop and the open shop scheduling problems. We restrict ourselves to basic problems: the processing times are fixed, there are neither set-up times nor due dates nor release dates, etc. Then, the objective is the minimization of the makespan.

引用

页码：278 / 285

页数：8

共 14 条

[1]

Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149

[2] OR-LIBRARY - DISTRIBUTING TEST PROBLEMS BY ELECTRONIC MAIL [J].

BEASLEY, JE .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (11) :1069-1072

[3]

BRASEL H, 1991, CONSTRUCTIVE HEURIST

[4]

Bratley P, 1983, GUIDE SIMULATION

[5] AN ALGORITHM FOR SOLVING THE JOB-SHOP PROBLEM [J].

CARLIER, J ;

PINSON, E .

MANAGEMENT SCIENCE, 1989, 35 (02) :164-176

[6]

CARLIER J, 1984, PROBLEMES ORDONNANCE

[7]

Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]

[8]

KLEINAU U, 1991, SOME NEW METHODS SOL

[9]

LAWLER EL, 1989, BSR89XX CTR MATH COM

[10]

Lawrence S., 1982, RESOURCE CONSTRAINED

← 1 2 →