{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:44:36Z","timestamp":1745343876790,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070452"},{"type":"electronic","value":"9783319070469"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_5","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"55-70","source":"Crossref","is-referenced-by-count":7,"title":["A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Kosch","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"J. Hooker","year":"2005","unstructured":"Hooker, J.: A hybrid method for planning and scheduling. Constraints\u00a010, 385\u2013401 (2005)","journal-title":"Constraints"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"J.C. Beck","year":"2011","unstructured":"Beck, J.C., Feng, T.K., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS Journal on Computing\u00a023(1), 1\u201314 (2011)","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR3","unstructured":"Tran, T.T., Beck, J.C.: Logic-based benders decomposition for alternative resource scheduling with sequence-dependent setups. In: Proceedings of the Twentieth European Conference on Artificial Intelligence (ECAI 2012), pp. 774\u2013779 (2012)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ejor.2012.04.008","volume":"221","author":"A. Malapert","year":"2012","unstructured":"Malapert, A., Gu\u00e9ret, C., Rousseau, L.M.: A constraint programming approach for a batch processing problem with non-identical job sizes. European Journal of Operational Research\u00a0221, 533\u2013545 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A. Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.: Solving RCPSP\/max by lazy clause generation. Journal of Scheduling\u00a016(3), 273\u2013289 (2013)","journal-title":"Journal of Scheduling"},{"issue":"1-2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints\u00a05(1-2), 119\u2013139 (2000)","journal-title":"Constraints"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in O(kn\u00a0log\u00a0n). In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 802\u2013816. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1009749006768","volume":"2","author":"E.C. Freuder","year":"1997","unstructured":"Freuder, E.C.: In pursuit of the holy grail. Constraints\u00a02, 57\u201361 (1997)","journal-title":"Constraints"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-38171-3_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Heinz","year":"2013","unstructured":"Heinz, S., Ku, W.-Y., Beck, J.C.: Recent improvements using constraint integer programming for resource allocation and scheduling. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 12\u201327. Springer, Heidelberg (2013)"},{"key":"5_CR11","unstructured":"Daste, D., Gueret, C., Lahlou, C.: A branch-and-price algorithm to minimize the maximum lateness on a batch processing machine. In: Proceedings of the 11th International Workshop on Project Management and Scheduling (PMS), Istanbul, Turkey, pp. 64\u201369 (2008)"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.Y. Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res.\u00a040(4), 764\u2013775 (1992)","journal-title":"Oper. Res."},{"key":"5_CR13","unstructured":"Grossmann, I.E.: Mixed-integer optimization techniques for the design and scheduling of batch processes. Technical Report Paper 203, Carnegie Mellon University Engineering Design Research Center and Department of Chemical Engineering (1992)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling\u00a01(1), 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"key":"5_CR15","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall (2003)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-540-30201-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Shaw","year":"2004","unstructured":"Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 648\u2013662. Springer, Heidelberg (2004)"},{"issue":"10","key":"5_CR17","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1080\/00207540050028034","volume":"38","author":"M. Azizoglu","year":"2000","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research\u00a038(10), 2173\u20132184 (2000)","journal-title":"International Journal of Production Research"},{"issue":"7","key":"5_CR18","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L. Dupont","year":"2002","unstructured":"Dupont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure. Computers & Operations Research\u00a029(7), 807\u2013819 (2002)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.apm.2009.04.007","volume":"34","author":"M.Y. Sabouni","year":"2010","unstructured":"Sabouni, M.Y., Jolai, F.: Optimal methods for batch processing problem with makespan and maximum lateness objectives. Applied Mathematical Modelling\u00a034(2), 314\u2013324 (2010)","journal-title":"Applied Mathematical Modelling"},{"issue":"27-29","key":"5_CR20","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1016\/j.tcs.2009.02.014","volume":"410","author":"A.H. Kashan","year":"2009","unstructured":"Kashan, A.H., Karimi, B., Ghomi, S.M.T.F.: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes. Theoretical Computer Science\u00a0410(27-29), 2754\u20132758 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"20","key":"5_CR21","doi-asserted-by":"publisher","first-page":"6022","DOI":"10.1080\/00207543.2011.641358","volume":"50","author":"O. Ozturk","year":"2012","unstructured":"Ozturk, O., Espinouse, M.L., Mascolo, M.D., Gouin, A.: Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates. International Journal of Production Research\u00a050(20), 6022\u20136035 (2012)","journal-title":"International Journal of Production Research"},{"key":"5_CR22","unstructured":"IBM ILOG: User\u2019s manual for cplex (2013)"},{"key":"5_CR23","unstructured":"Ilog, I.: Cplex optimization suite 12.5 (2013)"},{"key":"5_CR24","unstructured":"Choco Team: Choco: An open source java constraint programming library. version 2.1.5 (2013)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:13:58Z","timestamp":1609204438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}