Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
V-shaped policies for scheduling deteriorating jobs
Operations Research
Scheduling jobs under simple linear deterioration
Computers and Operations Research
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
Computers and Operations Research
Single-machine group scheduling with a time-dependent learning effect
Computers and Operations Research
Single machine group scheduling under decreasing linear deterioration
Journal of Applied Mathematics and Computing
A deteriorating jobs problem with quadratic function of job lateness
Computers and Industrial Engineering
Single-machine group scheduling problems under the effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling with a nonlinear deterioration function
Information Processing Letters
Single-machine group scheduling with resource allocation and learning effect
Computers and Industrial Engineering
Scheduling problems with general effects of deterioration and learning
Information Sciences: an International Journal
Single-machine group scheduling with both learning effects and deteriorating jobs
Computers and Industrial Engineering
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
Computers and Operations Research
Some single-machine and flowshop scheduling problems with a non-linear deterioration function
Computers & Mathematics with Applications
Journal of Combinatorial Optimization
Hi-index | 0.01 |
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework of minimizing the makespan and the total completion time in single-machine group scheduling problems. We show that these problems remain polynomially solvable when deterioration is considered.