{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:43Z","timestamp":1740123223315,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10479-019-03503-9","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T16:06:13Z","timestamp":1576253173000},"page":"461-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounded colouring motivated by the limited resource partially concurrent open shop problem"],"prefix":"10.1007","volume":"302","author":[{"given":"Hagai","family":"Ilani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4106-3169","authenticated-orcid":false,"given":"Tal","family":"Grinshpoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"issue":"1","key":"3503_CR1","doi-asserted-by":"publisher","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":"3503_CR2","doi-asserted-by":"publisher","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":"3503_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","volume":"165","author":"D de Werra","year":"1997","unstructured":"de Werra, D. (1997). Restricted coloring models for timetabling. Discrete Mathematics, 165, 161\u2013170.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"3503_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0166-218X(92)90245-6","volume":"35","author":"D de Werra","year":"1992","unstructured":"de Werra, D., & Blazewicz, J. (1992). Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. Discrete Applied Mathematics, 35(3), 205\u2013219.","journal-title":"Discrete Applied Mathematics"},{"key":"3503_CR5","volume-title":"Graph theory, volume 173 of graduate texts in mathematics","author":"R Diestel","year":"2017","unstructured":"Diestel, R. (2017). Graph theory, volume 173 of graduate texts in mathematics (5th ed.). Berlin: Springer.","edition":"5"},{"issue":"2\u20133","key":"3503_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BF01817698","volume":"2","author":"AL Dulmage","year":"1969","unstructured":"Dulmage, A. L., & Mendelsohn, N. S. (1969). Some graphical properties of matrices with non-negative entries. Aequationes mathematicae, 2(2\u20133), 150\u2013162.","journal-title":"Aequationes mathematicae"},{"issue":"3","key":"3503_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1515\/acsc-2016-0016","volume":"26","author":"H Furma\u0144czyk","year":"2016","unstructured":"Furma\u0144czyk, H., Jastrzebski, A., & Kubale, M. (2016). Equitable coloring of graphs. Recent theoretical results and new practical algorithms. Archives of Control Sciences, 26(3), 281\u2013295.","journal-title":"Archives of Control Sciences"},{"key":"3503_CR8","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)."},{"issue":"2","key":"3503_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10479-015-1934-1","volume":"252","author":"T Grinshpoun","year":"2017","unstructured":"Grinshpoun, T., Ilani, H., & Shufan, E. (2017). The representation of partially-concurrent open shop problems. Annals of Operations Research, 252(2), 455\u2013469.","journal-title":"Annals of Operations Research"},{"key":"3503_CR10","volume-title":"Geometric algorithms and combinatorial optimization, volume 2 of algorithms and combinatorics","author":"M Gr\u00f6tschel","year":"2012","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (2012). Geometric algorithms and combinatorial optimization, volume 2 of algorithms and combinatorics. Berlin: Springer."},{"issue":"1","key":"3503_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(93)90165-P","volume":"111","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Hertz, A., & Kuplinsky, J. (1993). Bounded vertex colorings of graphs. Discrete Mathematics, 111(1), 305\u2013312.","journal-title":"Discrete Mathematics"},{"key":"3503_CR12","unstructured":"Ilani, H., Shufan, E., & Grinshpoun, T. (2016). Partially concurrent open shop scheduling and graph colourings. In Proceedings of the 11th international conference of the practice and theory of automated timetabling (PATAT) (pp. 195\u2013205)."},{"issue":"1\u20132","key":"3503_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10479-017-2503-6","volume":"259","author":"H Ilani","year":"2017","unstructured":"Ilani, H., Shufan, E., & Grinshpoun, T. (2017). Partially concurrent open shop scheduling with integral preemptions. Annals of Operations Research, 259(1\u20132), 157\u2013171.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3503_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/S089548019630978X","volume":"12","author":"J Janssen","year":"1999","unstructured":"Janssen, J., & Kilakos, K. (1999). Bounded stable sets: Polytopes and colorings. SIAM Journal on Discrete Mathematics, 12(2), 262\u2013275.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"3503_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","volume":"155","author":"S Klav\u1e91ar","year":"1996","unstructured":"Klav\u1e91ar, S. (1996). Coloring graph products: A survey. Discrete Mathematics, 155(1), 135\u2013145.","journal-title":"Discrete Mathematics"},{"key":"3503_CR16","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":"3503_CR17","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":"3503_CR18","volume-title":"Fractional graph theory: A rational approach to the theory of graphs","author":"ER Scheinerman","year":"2011","unstructured":"Scheinerman, E. R., & Ullman, D. H. (2011). Fractional graph theory: A rational approach to the theory of graphs. North Chelmsford: Courier Corporation."},{"issue":"1","key":"3503_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D. J. A., & 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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03503-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-019-03503-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03503-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T16:16:21Z","timestamp":1623946581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-019-03503-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,13]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3503"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03503-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,12,13]]},"assertion":[{"value":"13 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}