{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:05:16Z","timestamp":1725613516477},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242878"},{"type":"electronic","value":"9783642242885"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24288-5_14","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T05:46:57Z","timestamp":1316843217000},"page":"153-164","source":"Crossref","is-referenced-by-count":0,"title":["Reachability and Deadlocking Problems in Multi-stage Scheduling"],"prefix":"10.1007","author":[{"given":"Christian E. J.","family":"Eggermont","sequence":"first","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM Journal on Computing\u00a01, 131\u2013137 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR2","unstructured":"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.\u00a09, pp. 484\u2013494 (2011)"},{"key":"14_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"14_CR4","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science","author":"E.L. Lawler","year":"1993","unstructured":"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.\u00a04, pp. 445\u2013522. North Holland, Amsterdam (1993)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1012203214611","volume":"13","author":"M. Lawley","year":"2001","unstructured":"Lawley, M., Reveliotis, S.: Deadlock avoidance for sequential resource allocation systems: hard and easy cases. The International Journal of Flexible Manufacturing Systems\u00a013, 385\u2013404 (2001)","journal-title":"The International Journal of Flexible Manufacturing Systems"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/70.976000","volume":"17","author":"W. Sulistyono","year":"2001","unstructured":"Sulistyono, W., Lawley, M.A.: Deadlock avoidance for manufacturing systems with partially ordered process plans. IEEE Transactions on Robotics and Automation\u00a017, 819\u2013832 (2001)","journal-title":"IEEE Transactions on Robotics and Automation"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24288-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T20:40:40Z","timestamp":1554669640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24288-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242878","9783642242885"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24288-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}