Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1082
Title: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Authors: Cheng, TCE 
Ding, Q
Keywords: Sequencing
Time dependence scheduling
Computational complexity
Issue Date: Jan-2003
Publisher: Pergamon Press
Source: Computers and operations research, Jan. 2003, v. 30, no. 1, p. 51-62 How to cite?
Journal: Computers and operations research 
Abstract: In this paper, we study the feasibility problem of scheduling a set of start time dependent tasks on a single machine with deadlines, processing rates and identical initial processing times. First, we show that the cases with arbitrary deadlines are strongly NP-complete. Second, we show that the cases with two distinct deadlines are NP-complete in the ordinary sense. Finally, we give an optimal polynomial algorithm for the makespan problem with two distinct processing rates. We solve a series of open problems in the literature and give a sharp boundary delineating the complexity of the problems.
URI: http://hdl.handle.net/10397/1082
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(01)00077-6
Rights: Computers & Operations Research © 2002 Elsevier Science Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
initial_140701.pdfPre-published version145.65 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

29
Last Week
0
Last month
0
Citations as of Jun 18, 2017

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
0
Citations as of Jun 21, 2017

Page view(s)

341
Last Week
1
Last month
Checked on Jun 25, 2017

Download(s)

398
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



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