Cyclic job shop scheduling problems with blocking

被引：0
作者：
Peter Brucker
Thomas Kampmeyer
机构：
[1] Universität Osnabrück,FB Mathematik/Informatik
[2] Bayer Technology Services GmbH,undefined
来源：
Annals of Operations Research | 2008年 / 159卷
关键词：
Cyclic job shop problem; Blocking; Tabu search;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：20
相关论文
共 12 条
  • [1] Brucker P.(2005)Tabu search algorithms for cyclic machine scheduling problems Journal of Scheduling 8 303-322
  • [2] Kampmeyer T.(1989)Tabu search. I ORSA Journal on Computing 1 190-206
  • [3] Glover F.(1990)Tabu search. II ORSA Journal on Computing 2 4-32
  • [4] Glover F.(1994)Study of a NP-hard cyclic scheduling problem: the recurrent job-shop European Journal of Operations Research 72 82-101
  • [5] Hanen C.(2002)Job-shop scheduling with blocking and no-wait constraints European Journal of Operations Research 143 498-517
  • [6] Mascis A.(1989)Sequencing in an assembly line with blocking to minimize cycle time Operations Research 37 925-935
  • [7] Pacciarelli D.(1998)Petri net modeling and scheduling for cyclic job shops with problems Computers Industrial Engineering 34 281-295
  • [8] McCormick S. T.(undefined)undefined undefined undefined undefined-undefined
  • [9] Pinedo M.(undefined)undefined undefined undefined undefined-undefined
  • [10] Shenker S.(undefined)undefined undefined undefined undefined-undefined
12