Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

@inproceedings{Mosheiov1995SchedulingJW,
  title={Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine},
  author={Gur Mosheiov},
  year={1995}
}
Certain maintenance procedures fail to perform prior to a pre-specified deadline and need extra time for successful accomplishment. Processing times under this specific deterioriation are represented by a step function. We study the problem of makespan minimization of step-wise deteriorating jobs. We introduce compact integer programming formulations. We then focus on heuristic methods, since even the case of single machine single-step deterioration is NP-complete. These methods are extended to… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 37 CITATIONS

Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A concise survey of scheduling with time-dependent processing times

VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED