{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:45:28Z","timestamp":1775594728951,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642213106","type":"print"},{"value":"9783642213113","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_10","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"92-98","source":"Crossref","is-referenced-by-count":8,"title":["Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach"],"prefix":"10.1007","author":[{"given":"Emrah B.","family":"Edis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ceyda","family":"Oguz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0167-6377(83)90042-1","volume":"2","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Operations Research Letters\u00a02(2), 80\u201383 (1983)","journal-title":"Operations Research Letters"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF00263292","volume":"24","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz, J., Kubiak, W., R\u00f6ck, H., Szwarcfiter, J.: Minimizing mean flow time with parallel processors and resource constraints. Acta Informatica\u00a024, 513\u2013524 (1987)","journal-title":"Acta Informatica"},{"key":"10_CR3","first-page":"147","volume":"32","author":"J.A. Ventura","year":"2000","unstructured":"Ventura, J.A., Kim, D.: Parallel machine scheduling about an unrestricted due date and additional resource constraints. IIE Transactions\u00a032, 147\u2013153 (2000)","journal-title":"IIE Transactions"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0377-2217(02)00246-1","volume":"147","author":"H. Kellerer","year":"2003","unstructured":"Kellerer, H., Strusevisch, V.A.: Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research\u00a0147, 345\u2013364 (2003)","journal-title":"European Journal of Operational Research"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(03)00433-5","volume":"133","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Strusevisch, V.A.: Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics\u00a0133, 45\u201368 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(97)00138-8","volume":"84","author":"M.Y. Kovalyov","year":"1998","unstructured":"Kovalyov, M.Y., Shafransky, Y.M.: Uniform machine scheduling of unit-time jobs subject to resource constraints. Discrete Applied Mathematics\u00a084, 253\u2013257 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/S0305-0548(02)00118-1","volume":"30","author":"J.A. Ventura","year":"2003","unstructured":"Ventura, J.A., Kim, D.: Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints. Computers and Operations Research\u00a030, 1945\u20131958 (2003)","journal-title":"Computers and Operations Research"},{"key":"10_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-69052-8_36","volume-title":"New Frontiers in Applied Artificial Intelligence","author":"E.B. Edis","year":"2008","unstructured":"Edis, E.B., Araz, C., Ozkarahan, I.: Lagrangian-based solution approaches for a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds.) IEA\/AIE 2008. LNCS (LNAI), vol.\u00a05027, pp. 337\u2013346. Springer, Heidelberg (2008)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0166-218X(93)90042-M","volume":"42","author":"J. Blazewicz","year":"1993","unstructured":"Blazewicz, J., Kubiak, W., Martello, S.: Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discrete Applied Mathematics\u00a042, 123\u2013138 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1002\/nav.20292","volume":"55","author":"H. Kellerer","year":"2008","unstructured":"Kellerer, H., Strusevisch, V.A.: Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics\u00a055(5), 377\u2013389 (2008)","journal-title":"Naval Research Logistics"},{"key":"10_CR11","unstructured":"Li, Y., Wang, F., Lim, A.: Resource constraints machine scheduling: A genetic algorithm approach. In: 2003 Congress on Evolutionary Computation, vol.\u00a01-4, pp. 1080\u20131085 (2003)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., Fahle, T.: Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research\u00a0118, 17\u201333 (2003)","journal-title":"Annals of Operations Research"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF00137871","volume":"1","author":"K.D. Darbi-Dowman","year":"1997","unstructured":"Darbi-Dowman, K.D., Little, J., Mitra, G., Zaffalon, M.: Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints\u00a01, 245\u2013264 (1997)","journal-title":"Constraints"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF00143880","volume":"1","author":"B.M. Smith","year":"1997","unstructured":"Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The progressive party problem: integer linear programming and constraint programming compared. Constraints\u00a01, 119\u2013138 (1997)","journal-title":"Constraints"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/ijoc.10.3.276","volume":"10","author":"K.D. Darbi-Dowman","year":"1998","unstructured":"Darbi-Dowman, K.D., Little, J.: Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. Informs Journal on Computing\u00a010(3), 276\u2013286 (1998)","journal-title":"Informs Journal on Computing"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/inte.31.6.29.9647","volume":"31","author":"I.J. Lustig","year":"2001","unstructured":"Lustig, I.J., Puget, J.F.: Program does not equal program: Constraint programming and its relationship to mathematical programming. Interfaces\u00a031(6), 29\u201353 (2001)","journal-title":"Interfaces"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/03052151003759117","volume":"43","author":"E.B. Edis","year":"2011","unstructured":"Edis, E.B., Ozkarahan, I.: A combined integer\/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. Engineering Optimization\u00a043(2), 135\u2013157 (2011)","journal-title":"Engineering Optimization"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J.N. Hooker","year":"2005","unstructured":"Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 314\u2013327. Springer, Heidelberg (2005)"},{"key":"10_CR19","unstructured":"IBM, ILOG OPL IDE 6.3., User\u2019s Manual, IBM Corp. (2009)"},{"key":"10_CR20","unstructured":"Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Proceedings of the Twenty-First International FLAIRS Conference, pp. 555\u2013560 (2008)"},{"key":"10_CR21","unstructured":"IBM, ILOG CPLEX 12.1., User\u2019s Manual, IBM Corp. (2009)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:02:59Z","timestamp":1609203779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}