New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

DOI10.1007/S10479-012-1075-8zbMath1251.90113OpenAlexW1979873925MaRDI QIDQ1761791

Michael Andresen, Tanka Nath Dhamala

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1075-8

zbMATH Keywords

complexityreducibilityschedulingcomparability graphopen shop

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

The representation of partially-concurrent open shop problems ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Comparability graphs and a new matroid
• Modular decomposition and transitive orientation
• Algorithmic graph theory and perfect graphs
• On the set of solutions of the open shop problem
• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan