Cyclic job shop scheduling problems with blocking

被引：41

作者：

Brucker, Peter ^{[2
]}

Kampmeyer, Thomas ^{[1
]}

机构：

[1] Bayer Technol Serv GmbH, D-51368 Leverkusen, Germany

[2] Univ Osnabruck, FB Math Informat, D-49069 Osnabruck, Germany

来源：

ANNALS OF OPERATIONS RESEARCH | 2008年 / 159卷 / 01期

关键词：

cyclic job shop problem; blocking; tabu search;

D O I：

10.1007/s10479-007-0276-z

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if they must stay on a machine after finishing when the next machine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.

引用

页码：161 / 181

页数：21

共 13 条

[1]

BEASLEY JE, 2005, BENCHMARK PROBLEMS

[2]

Tabu search algorithms for cyclic machine scheduling problems [J].

Brucker, P ;

Kampmeyer, T .

JOURNAL OF SCHEDULING, 2005, 8 (04) :303-322

[3]

BRUCKER P, 2007, IN PRESS DISCRETE AP

[4]

Brucker Peter, 2004, Scheduling Algorithms

[5]

CARLIER J, 1988, PROBLEMS ORDONNANCEM

[6]

Dasdan A., 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361), P37, DOI 10.1109/DAC.1999.781227

[7]

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

[8]

STUDY OF A NP-HARD CYCLIC SCHEDULING PROBLEM - THE RECURRENT JOB-SHOP [J].

HANEN, C .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) :82-101

[9]

KAMPMEYER T, 2006, THESIS U OSNABRUCK

[10]

Job-shop scheduling with blocking and no-wait constraints [J].

Mascis, A ;

Pacciarelli, D .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (03) :498-517

← 1 2 →