Please use this identifier to cite or link to this item:
Title: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Authors: Cheng, T. C. Edwin
Ding, Q.
Subjects: Sequencing
Time dependence scheduling
Computational complexity
Issue Date: Jan-2003
Publisher: Pergamon (Elsevier)
Source: Computers & operations research, Jan. 2003, v. 30, no. 1, p. 51-62.
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.
Rights: Computers & Operations Research © 2002 Elsevier Science Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/S0305-0548(01)00077-6
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File SizeFormat 
initial_140701.pdf145.65 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.