Scheduling deteriorating jobs on a single machine to minimize the maximum processing times

DOI10.1080/00207729608929242zbMath0849.90075OpenAlexW1984796644MaRDI QIDQ4883811

Bahram Alidaee, Frank G. Landram

Publication date: 7 November 1996

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729608929242

zbMATH Keywords

single machinesequencingheuristic algorithmmaximum processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Scheduling on a single processor with variable speed ⋮ Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis ⋮ Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

Cites Work

• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Scheduling deteriorating jobs on a single machine to minimize the maximum processing times