{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:47Z","timestamp":1759847387973},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T00:00:00Z","timestamp":1329264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-012-1075-8","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T16:32:41Z","timestamp":1329237161000},"page":"1-26","source":"Crossref","is-referenced-by-count":3,"title":["New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan"],"prefix":"10.1007","volume":"196","author":[{"given":"Michael","family":"Andresen","sequence":"first","affiliation":[]},{"given":"Tanka Nath","family":"Dhamala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,15]]},"reference":[{"key":"1075_CR1","unstructured":"Andresen, M. (2009). On the complexity of reducibility problems through H-comparability graphs. PhD thesis. University of Magdeburg, Germany (in German)."},{"key":"1075_CR2","first-page":"49","volume-title":"Global optimization: focus on simulated annealing, I\u2014techonline","author":"M. Andresen","year":"2008","unstructured":"Andresen, M., Br\u00e4sel, H., Plauschin, M., & Werner, F. (2008). Using simulated annealing for open shop scheduling with sum criteria. In Global optimization: focus on simulated annealing, I\u2014techonline (pp.\u00a049\u201376)."},{"key":"1075_CR3","first-page":"115","volume":"37","author":"H. Br\u00e4sel","year":"2001","unstructured":"Br\u00e4sel, H., Harborth, M., & Willenius, P. (2001). Isomorphism for digraphs and sequences of shop scheduling problems. JCMCC. Journal of Combinatorial Mathematics and Combinatorial Computing, 37, 115\u2013128.","journal-title":"JCMCC. Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"1075_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018938915709","volume":"92","author":"H. Br\u00e4sel","year":"1999","unstructured":"Br\u00e4sel, H., Harborth, M., Tautenhahn, T., & Willenius, P. (1999). On the set of solutions of an open shop problem. Annals of Operations Research, 92, 241\u2013263.","journal-title":"Annals of Operations Research"},{"key":"1075_CR5","first-page":"195","volume":"43","author":"H. Br\u00e4sel","year":"1996","unstructured":"Br\u00e4sel, H., & Kleinau, M. (1996). New steps in the amazing world of sequences and schedules. Mathematical and Computer Modelling, 43, 195\u2013214.","journal-title":"Mathematical and Computer Modelling"},{"key":"1075_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3126\/njst.v11i0.4147","volume":"11","author":"T. N. Dhamala","year":"2010","unstructured":"Dhamala, T. N. (2010). On the status of irreducibility problems of open shop sequencing problems. Nepal Journal of Science and Technology, 11, 205\u2013214.","journal-title":"Nepal Journal of Science and Technology"},{"key":"1075_CR7","first-page":"1","volume":"4","author":"T. N. Dhamala","year":"2007","unstructured":"Dhamala, T. N. (2007). On the potentially optimal solutions of classical shop scheduling problems. International Journal of Operations Research, 4, 1\u201310.","journal-title":"International Journal of Operations Research"},{"key":"1075_CR8","series-title":"Annals of discrete mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"2004","unstructured":"Golumbic, M. C. (2004). Annals of discrete mathematics: Vol.\u00a057. Algorithmic graph theory and perfect graphs, 2nd ed. Elsevier, Amsterdam.","edition":"2"},{"key":"1075_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90049-1","volume":"22","author":"M. C. Golumbic","year":"1977","unstructured":"Golumbic, M. C. (1977). Comparability graphs and a new matroid. Journal of Combinatorial Theory, Series B, 22, 68\u201390.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"1075_CR10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 23(4), 665\u2013679.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1075_CR11","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. (1979). Computers and intractability: a guide to the theory of NP-completeness. Freeman &, New York."},{"key":"1075_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R. M. McConnell","year":"1999","unstructured":"McConnell, R. M., & Spinrad, J. P. (1999). Modular decomposition and transitive orientation. Discrete Mathematics, 201, 189\u2013241.","journal-title":"Discrete Mathematics"},{"key":"1075_CR13","unstructured":"Willenius, P. (2000). Irreducibility theory in scheduling theory. PhD thesis. University of Magdeburg, Germany (in German)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1075-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1075-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1075-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T18:05:26Z","timestamp":1561313126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1075-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,15]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1075-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,15]]}}}