Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Authors:
T. C. E. Cheng;Q. Ding
Affiliations:
Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2003

Citing 8
Cited 9

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Scheduling with time-dependent execution times

Information Processing Letters
The time dependent machine makespan problem is strongly NP-complete

Computers and Operations Research
Single machine scheduling with deadlines and increasing rates of processing times

Acta Informatica
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on single-processor scheduling with time-dependent execution times

Operations Research Letters

Single-machine group scheduling problems with deterioration consideration

Computers and Operations Research
Scheduling deteriorating jobs on a single machine with release times

Computers and Industrial Engineering
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
A deteriorating jobs problem with quadratic function of job lateness

Computers and Industrial Engineering
A note on optimal policies for two group scheduling problems with deteriorating setup and processing times

Computers and Industrial Engineering
Connected searching of weighted trees

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Some single-machine and flowshop scheduling problems with a non-linear deterioration function

Computers & Mathematics with Applications
Connected searching of weighted trees

Theoretical Computer Science
A single-machine scheduling with a truncated linear deterioration and ready times

Information Sciences: an International Journal

Quantified Score

Hi-index	0.02

Visualization

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.