Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
From MaRDI portal
Publication:5690159
DOI<1127::AID-NAV5>3.0.CO;2-G 10.1002/(SICI)1520-6750(199612)43:8<1127::AID-NAV5>3.0.CO;2-GzbMath0871.90043OpenAlexW1976534804MaRDI QIDQ5690159
Publication date: 15 January 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199612)43:8<1127::aid-nav5>3.0.co;2-g
Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)
Related Items (7)
Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Single machine stochastic JIT scheduling problem subject to machine breakdowns ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model ⋮ Due-window assignment scheduling problem with stochastic 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: Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
