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

DOI10.1016/0377-2217(94)00185-5zbMath0913.90156MaRDI 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 sequence; single machine sequencing; V-shaped sequences

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

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

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