A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem

DOI10.1016/0377-2217(94)90335-2zbMath0798.90081OpenAlexW1993247172WikidataQ57634026 ScholiaQ57634026MaRDI QIDQ1319570

Dagmar Kluge, Heidemarie Bräsel, Frank Werner

Publication date: 12 April 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90335-2

zbMATH Keywords

polynomial algorithmopen shop problemlatin rectangles

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On a routing Open Shop Problem on two nodes with unit processing times, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Four decades of research on the open-shop scheduling problem to minimize the makespan, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Open-shop scheduling for unit jobs under precedence constraints, Extensions of coloring models for scheduling purposes

Cites Work

• Openshop and flowshop scheduling to minimize sum of completion times
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item
• Unnamed Item
• Unnamed Item