Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1082
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Ding, Q | - |
dc.date.accessioned | 2014-12-11T08:26:59Z | - |
dc.date.available | 2014-12-11T08:26:59Z | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1082 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | Computers & Operations Research © 2002 Elsevier Science Ltd. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Sequencing | en_US |
dc.subject | Time dependence scheduling | en_US |
dc.subject | Computational complexity | en_US |
dc.title | Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 51 | - |
dc.identifier.epage | 62 | - |
dc.identifier.volume | 30 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1016/S0305-0548(01)00077-6 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Computers and operations research, Jan. 2003, v. 30, no. 1, p. 51-62 | - |
dcterms.isPartOf | Computers and operations research | - |
dcterms.issued | 2003-01 | - |
dc.identifier.isi | WOS:000179417500004 | - |
dc.identifier.scopus | 2-s2.0-0037211214 | - |
dc.identifier.eissn | 1873-765X | - |
dc.identifier.rosgroupid | r11438 | - |
dc.description.ros | 2002-2003 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
initial_140701.pdf | Pre-published version | 145.65 kB | Adobe PDF | View/Open |
Page views
133
Last Week
2
2
Last month
Citations as of Apr 21, 2024
Downloads
222
Citations as of Apr 21, 2024
SCOPUSTM
Citations
32
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
29
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.