Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I" /><261::AID-NAV3220380210>3.0.CO;2-I 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-IzbMath0729.90050OpenAlexW2009408661MaRDI QIDQ3354454

Alexander H. G. Rinnooy Kan, Igal Adiri, Esther Frostig

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199104)38:2<261::aid-nav3220380210>3.0.co;2-i

zbMATH Keywords

single machinedue datesbreakdownnumber of tardy jobsnonpreemptive schedulingrepair time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Maintenance scheduling problem with fuzzy random time windows on a single machine ⋮ Optimal rules for single machine scheduling with stochastic breakdowns ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance ⋮ Scheduling under machine breakdown in a continuous process industry ⋮ The effect of service time variability on maximum queue lengths in M^X/G/1 queues ⋮ Single-machine scheduling with periodic maintenance and nonresumable jobs.

This page was built for publication: Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs