Scheduling deteriorating jobs on a single processor
Operations Research
V-shaped policies for scheduling deteriorating jobs
Operations Research
Complexity of scheduling tasks with time-dependent execution times
Information Processing Letters
Scheduling jobs under simple linear deterioration
Computers and Operations Research
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
The complexity of scheduling starting time dependent tasks with release times
Information Processing Letters
Three scheduling problems with deteriorating jobs to minimize the total completion time
Information Processing Letters
Scheduling Algorithms
Minimizing the total weighted completion time of deteriorating jobs
Information Processing Letters
Scheduling jobs under decreasing linear deterioration
Information Processing Letters
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Some single-machine and flowshop scheduling problems with a non-linear deterioration function
Computers & Mathematics with Applications
Computers & Mathematics with Applications
The solution algorithms for the multiprocessor scheduling with workspan criterion
Expert Systems with Applications: An International Journal
| Hi-index | 0.09 |
This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. It is shown that for the problems of minimization of the makespan, polynomial algorithms exist.