Scheduling jobs with release dates and deadlines on a batch processing machine

Citation
Tce. Cheng et al., Scheduling jobs with release dates and deadlines on a batch processing machine, IIE TRANS, 33(8), 2001, pp. 685-690
Citations number
8
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Engineering Management /General
Journal title
IIE TRANSACTIONS
ISSN journal
0740-817X → ACNP
Volume
33
Issue
8
Year of publication
2001
Pages
685 - 690
Database
ISI
SICI code
0740-817X(200108)33:8<685:SJWRDA>2.0.ZU;2-6
Abstract
In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and p rocessing times; a fixed number of distinct release dates, distinct process ing times or distinct deadlines.