{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:02:41Z","timestamp":1648890161264},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,7,15]],"date-time":"2012-07-15T00:00:00Z","timestamp":1342310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10107-012-0580-5","type":"journal-article","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:56:58Z","timestamp":1342259818000},"page":"331-348","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of multi-stage open shop processing systems"],"prefix":"10.1007","volume":"142","author":[{"given":"Christian E. J.","family":"Eggermont","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Schrijver","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,15]]},"reference":[{"key":"580_CR1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1109\/70.63273","volume":"6","author":"Z.A. Banaszak","year":"1990","unstructured":"Banaszak Z.A., Krogh B.H.: Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Trans. Robot. Autom. 6, 724\u2013734 (1990)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"580_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/356586.356588","volume":"3","author":"E.G. Coffman","year":"1971","unstructured":"Coffman E.G., Elphick M.J., Shoshani A.: System deadlocks. ACM Comput. Surv. 3, 67\u201378 (1971)","journal-title":"ACM Comput. Surv."},{"key":"580_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms. MIT Press, Cambridge, MA (2001)"},{"key":"580_CR4","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":"580_CR5","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0207027","volume":"7","author":"M. Gold","year":"1978","unstructured":"Gold M.: Deadlock prediction: easy and difficult cases. SIAM J. Comput. 7, 320\u2013336 (1978)","journal-title":"SIAM J. Comput."},{"key":"580_CR6","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory. Handbooks in Operations Research and Management Science, vol. 4. North-Holland, Amsterdam, pp. 445\u2013522 (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"580_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/70.768182","volume":"15","author":"M. Lawley","year":"1999","unstructured":"Lawley M.: Deadlock avoidance for production systems with flexible routing. IEEE Trans. Robot. Autom. 15, 497\u2013510 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"580_CR8","volume-title":"Matching Theory. Annals of Discrete Mathematics, vol. 29","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Plummer M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. Elsevier, North-Holland (1986)"},{"key":"580_CR9","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1109\/70.976000","volume":"17","author":"W. Sulistyono","year":"2001","unstructured":"Sulistyono W., Lawley M.: Deadlock avoidance for manufacturing systems with partially ordered process plans. IEEE Trans. Robot. Autom. 17, 819\u2013832 (2001)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"580_CR10","unstructured":"Xing, K., Lin, F., Hu, B.: An optimal deadlock avoidance policy for manufacturing system with flexible operation sequence and flexible routing. In: Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA\u20192001), pp. 3565\u20133570 (2001)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0580-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0580-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0580-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:00Z","timestamp":1559124000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0580-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,15]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["580"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0580-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,15]]}}}