A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems

DOI10.1016/0377-2217(94)00185-5zbMath0913.90156OpenAlexW2039835419MaRDI QIDQ1266600

Umar M. Al-Turki, John Mittenthal, M. Raghavachari

Publication date: 6 June 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00185-5

zbMATH Keywords

optimal sequencesingle machine sequencingV-shaped sequences

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Common due-date assignment and scheduling on single machine with exponential processing times. ⋮ Tabu search for a class of single-machine scheduling problems ⋮ A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems

Cites Work

• V-shape property for optimal schedules with monotone penalty functions
• A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems
• Minimizing flowtime and missed due-dates in single-machine sequencing
• Sequencing with Earliness and Tardiness Penalties: A Review
• On the Assignment of Optimal Due Dates
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties

This page was built for publication: A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems