Dual criteria preemptive open-shop problems with minimum makespan

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199502)42:1<103::AID-NAV3220420109>3.0.CO;2-R" /><103::AID-NAV3220420109>3.0.CO;2-R 10.1002/1520-6750(199502)42:1<103::AID-NAV3220420109>3.0.CO;2-RzbMath0822.90085OpenAlexW2034689541MaRDI QIDQ4698132

George L. Vairaktarakis, Sartaj K. Sahni

Publication date: 18 October 1995

Full work available at URL: https://doi.org/10.1002/1520-6750(199502)42:1<103::aid-nav3220420109>3.0.co;2-r

zbMATH Keywords

load balancingpreventive maintenanceminimum makespan preemptive open shop

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (4)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two-machine open shop scheduling with an availability constraint ⋮ Workface planning in synchronous production systems

Cites Work

• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item
• Unnamed Item

This page was built for publication: Dual criteria preemptive open-shop problems with minimum makespan