{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:27:32Z","timestamp":1658158052237},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,2,13]],"date-time":"2010-02-13T00:00:00Z","timestamp":1266019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10951-009-0149-1","type":"journal-article","created":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T16:25:08Z","timestamp":1265991908000},"page":"583-595","source":"Crossref","is-referenced-by-count":3,"title":["On a reduction of the interval coloring problem to a series of\u00a0bandwidth coloring problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Mathieu","family":"Bouchard","sequence":"first","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,13]]},"reference":[{"key":"149_CR1","doi-asserted-by":"crossref","first-page":"3615","DOI":"10.1016\/j.dam.2009.04.015","volume":"157","author":"M. Bouchard","year":"2009","unstructured":"Bouchard, M., \u010cangalovi\u0107, M., & Hertz, A. (2009). About equivalent interval colorings of weighted graphs. Discrete Applied Mathematics, 157, 3615\u20133624.","journal-title":"Discrete Applied Mathematics"},{"key":"149_CR2","unstructured":"\u010cangalovi\u0107, M. (1989). Some new combinatorial optimization algorithms applied to timetabling problems. Ph.D. thesis, University of Belgrade, Serbia (in Serbian)."},{"key":"149_CR3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(91)90254-S","volume":"51","author":"M. \u010cangalovi\u0107","year":"1991","unstructured":"\u010cangalovi\u0107, M., & Schreuder, J. A. M. (1991). Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths. European Journal of Operational Research, 51, 248\u2013258.","journal-title":"European Journal of Operational Research"},{"key":"149_CR4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1983.117","volume":"34","author":"A. T. Clementson","year":"1983","unstructured":"Clementson, A. T., & Elphick, C. H. (1983). Approximate coloring algorithms for composite graphs. Journal of Operational Research Society, 34, 503\u2013509.","journal-title":"Journal of Operational Research Society"},{"key":"149_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<365::AID-JGT6>3.0.CO;2-P","volume":"24","author":"W. A. Deuber","year":"1996","unstructured":"Deuber, W. A., & Zhu, X. (1996). Circular colorings of weighted graphs. Journal of Graph Theory, 24, 365\u2013376.","journal-title":"Journal of Graph Theory"},{"key":"149_CR6","doi-asserted-by":"crossref","unstructured":"Fabri, J. (1979). Automatic storage optimization. In: ACM SIGPLAN notices: proceedings of the 1979 SIGPLAN symposium on compiler construction, Vol.\u00a014\/8 (pp.\u00a083\u201391).","DOI":"10.1145\/800229.806957"},{"key":"149_CR7","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":"149_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. L. Ginsberg","year":"1993","unstructured":"Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"149_CR9","doi-asserted-by":"crossref","unstructured":"Lim, A., Zhu, Y., Lou, Q., & Rodrigues, B. (2005). Heuristic methods for graph coloring problems. In: Proceedings of the 2005 ACM symposium on applied computing (pp.\u00a0933\u2013939). Santa Fe, New Mexico.","DOI":"10.1145\/1066677.1066892"},{"key":"149_CR10","unstructured":"Prestwich, S. (2002). Constrained bandwidth multicoloration neighborhoods. In: Proceedings of computational symposium on graph coloring and its generalizations (pp. 126\u2013133). Ithaca, NY, USA."},{"key":"149_CR11","unstructured":"Punter, A. (1976). Systems for timetabling by computer based on graph coloring. Ph.D. thesis, C.N.A.A., Hatfield Polytechnic."},{"key":"149_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/comjnl\/19.4.329","volume":"19","author":"T. Sakaki","year":"1976","unstructured":"Sakaki, T., Nakashima, K., & Hattori, Y. (1976). Algorithms for finding in the lump both bounds of the chromatic number of a graph. The Computer Journal, 19, 329\u2013332.","journal-title":"The Computer Journal"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0149-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0149-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0149-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0149-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,13]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0149-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,13]]}}}