Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32063
Title: Scheduling jobs with release dates and deadlines on a batch processing machine
Authors: Cheng, TCE 
Liu, Z
Yu, W
Issue Date: 2001
Publisher: Taylor & Francis
Source: IIE transactions, 2001, v. 33, no. 8, p. 685-690 How to cite?
Journal: IIE transactions 
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 processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.
URI: http://hdl.handle.net/10397/32063
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1023/A:1010991401683
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

33
Last Week
0
Last month
0
Citations as of Sep 10, 2017

WEB OF SCIENCETM
Citations

30
Last Week
0
Last month
Citations as of Sep 21, 2017

Page view(s)

50
Last Week
4
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.