Ding Q.

Q. Ding

Information about the author Q. Ding will soon be added to the site.
Found 5 papers in total
A concise survey of scheduling with time-dependent processing times
A concise survey of scheduling with time-dependent processing times
2004
We consider a class of machine scheduling problems in which the processing time of a...
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
2003
In this paper, we study the feasibility problem of scheduling a set of start time...
Single machine scheduling with step-deteriorating processing times
Single machine scheduling with step-deteriorating processing times
2001
We study in this paper a scheduling model in which each task has a normal processing...
The time dependent machine makespan problem is strongly NP-complete
The time dependent machine makespan problem is strongly NP-complete
1999
The computational complexity of the problem of scheduling a set of start-time...
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
1998
The makespan problem on a single machine for a set of tasks with two distinct...
Papers per page: