{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:47Z","timestamp":1725558647511},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_10","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"111-124","source":"Crossref","is-referenced-by-count":8,"title":["Cost Constrained Fixed Job Scheduling"],"prefix":"10.1007","author":[{"given":"Qiwei","family":"Huang","sequence":"first","affiliation":[]},{"given":"Errol","family":"Lloyd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.35.6.849","volume":"35","author":"M. Fischetti","year":"1987","unstructured":"Fischetti, M., Martello, S., Toth, P.: The Fixed Job Schedule Problem with Spread-Time Constraints. Operations Research\u00a035(6), 849\u2013858 (1987)","journal-title":"Operations Research"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.37.3.395","volume":"37","author":"M. Fischetti","year":"1989","unstructured":"Fischetti, M., Martello, S., Toth, P.: The Fixed Job Schedule Problem with Working-Time Constraints. Operations Research\u00a037(3), 395\u2013403 (1989)","journal-title":"Operations Research"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0377-2217(91)90320-U","volume":"54","author":"A.W.J. Kolen","year":"1991","unstructured":"Kolen, A.W.J., Kroon, L.G.: On the Computational Complexity of (Maximum) Class Scheduling. European Journal of Operational Research\u00a054, 23\u201338 (1991)","journal-title":"European Journal of Operational Research"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0377-2217(92)90160-B","volume":"63","author":"A.W.J. Kolen","year":"1992","unstructured":"Kolen, A.W.J., Kroon, L.G.: License Class Design: Complexity and Algorithms. European Journal of Operational Research\u00a063, 432\u2013444 (1992)","journal-title":"European Journal of Operational Research"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0377-2217(93)90014-E","volume":"64","author":"A.W.J. Kolen","year":"1993","unstructured":"Kolen, A.W.J., Kroon, L.G.: On the Computational Complexity of (Maximum) Shift Class Scheduling. European Journal of Operational Research\u00a064, 138\u2013151 (1993)","journal-title":"European Journal of Operational Research"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0377-2217(94)90056-6","volume":"79","author":"A.W.J. Kolen","year":"1994","unstructured":"Kolen, A.W.J., Kroon, L.G.: An Analysis of Shift Class Design Problems. European Journal of Operational Research\u00a079, 417\u2013430 (1994)","journal-title":"European Journal of Operational Research"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L.G. Kroon","year":"1997","unstructured":"Kroon, L.G., Sen, A., Deng, H., Roy, A.: The optimal cost chromatic partition problem for trees and interval graphs. In: D\u2019Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol.\u00a01197, Springer, Heidelberg (1997)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jagm.1999.1022","volume":"34","author":"K. Jansen","year":"2000","unstructured":"Jansen, K.: Approximation Results for the Optimal Cost Chromatic Partition Problem. Journal of Algorithms\u00a034, 54\u201389 (2000)","journal-title":"Journal of Algorithms"},{"key":"10_CR9","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"10_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability, A Guide to the Theory of NP-Completeness (2000) (Twenty-second printing)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:10:25Z","timestamp":1552608625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}