Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

DOI10.1016/j.cor.2003.08.001zbMath1077.90025OpenAlexW2006199710MaRDI QIDQ1886856

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

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.001

zbMATH Keywords

Total completion timeBranch-and-bound algorithmSingle-machine schedulingStep deterioration

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time ⋮ 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 ⋮ Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling jobs under simple linear deterioration
• Single machine scheduling with start time dependent processing times: Some solvable cases
• A concise survey of scheduling with time-dependent processing times
• Single machine scheduling with deadlines and increasing rates of processing times
• A note on single-processor scheduling with time-dependent execution times
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling deteriorating jobs to minimize makespan
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs