Makespan minimization in single-machine scheduling with step-deterioration of processing times

DOI10.1057/palgrave.jors.2601693zbMath1095.90038OpenAlexW2048590534MaRDI QIDQ4661099

Bertrand M. T. Lin, Andy An-Kai Jeng

Publication date: 4 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601693

zbMATH Keywords

single-machine schedulingdynamic programmingbranch-and-boundmakespanstep-deterioration

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Single-machine scheduling with deteriorating jobs ⋮ A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems