Nonpreemptive open shop with restricted processing times

DOI10.1007/BF01415583zbMath0807.90062OpenAlexW2913957434MaRDI QIDQ4296296

Ondřej Čepek, Milan Vlach, Dominique de Werra

Publication date: 1 March 1995

Published in: ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415583

zbMATH Keywords

makespanpolynomially solvable casenonpreemptive \(m\)-machine open shop scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

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

Cites Work

• Unnamed Item
• Preemptive Scheduling, Linear Programming and Network Flows
• Open Shop Scheduling to Minimize Finish Time
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• An Algorithm for the Open-Shop Problem

This page was built for publication: Nonpreemptive open shop with restricted processing times