Dual criteria preemptive open-shop problems with minimum makespan

DOI10.1002/1520-6750(199502)42:1%3C103::AID-NAV3220420109%3E3.0.CO;2-RMaRDI QIDQ4698132zbMATH OpenOpenAlexFDO

Authors George L. Vairaktarakis, Sartaj Sahni

Publication date 18 October 1995

Full work available at URL https://doi.org/10.1002/1520-6750(199502)42:1%3C103::aid-nav3220420109%3E3.0.co;2-r

zbMATH Keywords

load balancingpreventive maintenanceminimum makespan preemptive open shop

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 808800
• Constructive heuristic algorithms for the open shop problem
• The open shop scheduling problem with a given sequence of jobs on one machine
• Scheduling two-machine preemptive open shops to minimize total completion time

Cites work

• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• Graph theory with applications
• Open Shop Scheduling to Minimize Finish Time

Cited in

(5)

• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• Two-machine open shop scheduling with an availability constraint
• 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
• Workface planning in synchronous production systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698132)