Abstract
We study reachability and deadlock detection questions in multi-stage scheduling systems. The jobs have partially ordered processing plans that dictate the order in which the job passes through the machines. Our results draw a sharp borderline between tractable and intractable cases of these questions: certain types of processing plans (that we call unconstrained and source-constrained) lead to algorithmically tractable problems, whereas all remaining processing plans lead to NP-hard problems.
We give conditions under which safe system states can be recognized in polynomial time, and we prove that without these conditions the recognition of safe system states is NP-hard. We show that deciding reachability of a given state is essentially equivalent to deciding safety. Finally, we establish NP-hardness of deciding whether the system can ever fall into a deadlock state.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM Journal on Computing 1, 131–137 (1972)
Eggermont, C.E.J., Schrijver, A., Woeginger, G.J.: Analysis of multi-state open shop processing systems. In: Proceedings of 28th International Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 9, pp. 484–494 (2011)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. North Holland, Amsterdam (1993)
Lawley, M., Reveliotis, S.: Deadlock avoidance for sequential resource allocation systems: hard and easy cases. The International Journal of Flexible Manufacturing Systems 13, 385–404 (2001)
Sulistyono, W., Lawley, M.A.: Deadlock avoidance for manufacturing systems with partially ordered process plans. IEEE Transactions on Robotics and Automation 17, 819–832 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eggermont, C.E.J., Woeginger, G.J. (2011). Reachability and Deadlocking Problems in Multi-stage Scheduling. In: Delzanno, G., Potapov, I. (eds) Reachability Problems. RP 2011. Lecture Notes in Computer Science, vol 6945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24288-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-24288-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24287-8
Online ISBN: 978-3-642-24288-5
eBook Packages: Computer ScienceComputer Science (R0)