EFFECTIVE JOB-SHOP SCHEDULING THROUGH ACTIVE CHAIN MANIPULATION

Authors
SUN DK BATTA R LIN L
Citation
Dk. Sun et al., EFFECTIVE JOB-SHOP SCHEDULING THROUGH ACTIVE CHAIN MANIPULATION, Computers & operations research, 22(2), 1995, pp. 159-172
Citations number
19
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
22
Issue
2
Year of publication
1995
Pages
159 - 172
Database
ISI
SICI code
0305-0548(1995)22:2<159:EJSTAC>2.0.ZU;2-U
Abstract
A practical yet effective heuristic algorithm is developed in this pap er for solving the make-span reduction job shop scheduling problem. Th e algorithm iteratively improves an existing job shop schedule through exploring the schedule's neighborhood, using a simple active chain ma nipulation scheme. A Tabu search technique is employed, as part of the active chain manipulation procedure developed in this paper, to preve nt the trap of local optimality. Test results show that the algorithm is capable of efficiently generating very good schedules.