JOB-SHOP SCHEDULING WITH DEADLINES

Authors
BALAS E LANCIA G SERAFINI P VAZACOPOULOS A
Citation
E. Balas et al., JOB-SHOP SCHEDULING WITH DEADLINES, Journal of combinatorial optimization, 1(4), 1998, pp. 329-353
Citations number
8
Categorie Soggetti
Mathematics,"Computer Science Interdisciplinary Applications",Mathematics,"Computer Science Interdisciplinary Applications
Journal title
Journal of combinatorial optimization → ACNP
ISSN journal
13826905
Volume
1
Issue
4
Year of publication
1998
Pages
329 - 353
Database
ISI
SICI code
1382-6905(1998)1:4<329:JSWD>2.0.ZU;2-2
Abstract
In this paper we deal with a variant of the Job Shop Scheduling Proble m. We consider the addition of release dates and deadlines to be met b y all jobs. The objective is makespan minimization if there are no tar dy jobs, and tardiness minimization otherwise. The problem is approach ed by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one machine problem which i s solved optimally. The overall procedure is heuristic and exhibits a good trade-off between computing time and solution quality.