The single-machine absolute-deviation early-tardy problem with random completion times

DOI<573::AID-NAV9>3.0.CO;2-4 10.1002/(SICI)1520-6750(199606)43:4<573::AID-NAV9>3.0.CO;2-4zbMath0848.90067OpenAlexW2069852385MaRDI QIDQ4883172

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

Publication date: 1 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199606)43:4<573::aid-nav9>3.0.co;2-4

zbMATH Keywords

single machinesequencingmachine breakdownscompletion timesearliness, and tardiness penaltiesweighted combination of due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic systems in control theory (general) (93E03)

Related Items (6)

Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ 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. ⋮ Scheduling problems with random processing times under expected earliness/tardiness costs ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times

This page was built for publication: The single-machine absolute-deviation early-tardy problem with random completion times