{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:19Z","timestamp":1759847899922},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T00:00:00Z","timestamp":1493856000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10479-017-2503-6","type":"journal-article","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T09:39:10Z","timestamp":1493890750000},"page":"157-171","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Partially concurrent open shop scheduling with integral preemptions"],"prefix":"10.1007","volume":"259","author":[{"given":"Hagai","family":"Ilani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Grinshpoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,4]]},"reference":[{"key":"2503_CR1","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G. (1946). Three observations on linear algebra. Univ Nac Tucum\u00e1n Revista A, 5, 147\u2013151.","journal-title":"Univ Nac Tucum\u00e1n Revista A"},{"issue":"2","key":"2503_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01680372","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 Methods of Operations Research, 43(2), 195\u2013214.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"2503_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/08886504.1994.10782112","volume":"27","author":"EK Burke","year":"1994","unstructured":"Burke, E. K., Elliman, D. G., & Weare, R. F. (1994). A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education, 27(1), 1\u201318.","journal-title":"Journal of Research on Computing in Education"},{"issue":"2","key":"2503_CR4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/net.1028","volume":"38","author":"M Caramia","year":"2001","unstructured":"Caramia, M., & Dell\u2019Olmo, P. (2001). Solving the minimum-weighted coloring problem. Networks, 38(2), 88\u2013101.","journal-title":"Networks"},{"key":"2503_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","volume":"165","author":"D Werra de","year":"1997","unstructured":"de Werra, D. (1997). Restricted coloring models for timetabling. Discrete Mathematics, 165, 161\u2013170.","journal-title":"Discrete Mathematics"},{"issue":"ROSE\u2013ARTICLE\u201319","key":"2503_CR6","first-page":"165","volume":"8","author":"D Werra de","year":"1970","unstructured":"de Werra, D. (1970). On some combinatorial problems arising in scheduling. CORS Journal, 8(ROSE\u2013ARTICLE\u20131970\u2013001), 165\u2013175.","journal-title":"CORS Journal"},{"issue":"3","key":"2503_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U Dorndorf","year":"2001","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open shop scheduling problem. Journal of Scheduling, 4(3), 157\u2013174.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"2503_CR8","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 ACM (JACM), 23(4), 665\u2013679.","journal-title":"Journal of the ACM (JACM)"},{"key":"2503_CR9","unstructured":"Grinshpoun, T., Ilani, H., & Shufan, E. (2014). Partially-concurrent open shop scheduling. In Proceedings of the 10th international conference of the practice and theory of automated timetabling (PATAT) (pp 188\u2013201)."},{"key":"2503_CR10","doi-asserted-by":"publisher","unstructured":"Grinshpoun, T., Ilani, H., & Shufan, E. (2015). The representation of partially-concurrent open shop problems. Annals of Operations Research. doi:\n                        10.1007\/s10479-015-1934-1\n                        \n                    .","DOI":"10.1007\/s10479-015-1934-1"},{"key":"2503_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","volume":"88","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1984). Polynomial algorithms for perfect graphs. North-Holland Mathematics Studies, 88, 325\u2013356.","journal-title":"North-Holland Mathematics Studies"},{"issue":"1","key":"2503_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","volume":"155","author":"S Klavar","year":"1996","unstructured":"Klavar, S. (1996). Coloring graph productsa survey. Discrete Mathematics, 155(1), 135\u2013145.","journal-title":"Discrete Mathematics"},{"key":"2503_CR13","first-page":"104","volume":"34","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D. (1916). Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re. Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi Ertesito, 34, 104\u2013119.","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi Ertesito"},{"issue":"3","key":"2503_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L. (1972). Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics, 2(3), 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"2503_CR15","volume-title":"Matching theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., & Plummer, M. D. (2009). Matching theory (Vol. 367). Providence: American Mathematical Society."},{"issue":"5","key":"2503_CR16","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M Mastrolilli","year":"2010","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A. S., Svensson, O., & Uhan, N. A. (2010). Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5), 390\u2013395.","journal-title":"Operations Research Letters"},{"issue":"4","key":"2503_CR17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1024284828374","volume":"6","author":"C Ng","year":"2003","unstructured":"Ng, C., Cheng, T. C. E., & Yuan, J. (2003). Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling, 6(4), 405\u2013412.","journal-title":"Journal of Scheduling"},{"key":"2503_CR18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(77)90056-5","volume":"20","author":"G Ravindra","year":"1977","unstructured":"Ravindra, G., & Parthasarathy, K. (1977). Perfect product graphs. Discrete Mathematics, 20, 177\u2013186.","journal-title":"Discrete Mathematics"},{"key":"2503_CR19","unstructured":"Rickman, J. P. (2014). The design of a course-timetabling system using graph-coloring and artificial intelligence. Honors Program Theses, paper 15, Rollins College."},{"issue":"515","key":"2503_CR20","first-page":"C525","volume":"9","author":"G Sabidussi","year":"1957","unstructured":"Sabidussi, G. (1957). Graphs with given group and given graph-theoretical properties. Canadian Journal of Mathematics, 9(515), C525.","journal-title":"Canadian Journal of Mathematics"},{"key":"2503_CR21","first-page":"5","volume":"2","author":"J Neumann von","year":"1953","unstructured":"von Neumann, J. (1953). A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games, 2, 5\u201312.","journal-title":"Contributions to the Theory of Games"},{"issue":"3","key":"2503_CR22","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"E Wagneur","year":"1993","unstructured":"Wagneur, E., & Sriskandarajah, C. (1993). Openshops with jobs overlap. European Journal of Operational Research, 71(3), 366\u2013378.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2503_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJ Welsh","year":"1967","unstructured":"Welsh, D. J., & Powell, M. B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1), 85\u201386.","journal-title":"The Computer Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2503-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2503-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2503-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T12:31:03Z","timestamp":1510835463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2503-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,4]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2503"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2503-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,4]]}}}