Cyclic job shop scheduling problems with blocking

被引：36
|
作者：
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
相关论文
共 50 条
12345