Reachability and Deadlocking Problems in Multi-stage Scheduling
From MaRDI portal
Publication:3172872
DOI10.1007/978-3-642-24288-5_14zbMath1347.90040OpenAlexW2162929969MaRDI QIDQ3172872
Christian E. J. Eggermont, Gerhard J. Woeginger
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_14
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Reachability and Deadlocking Problems in Multi-stage Scheduling