{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:41:05Z","timestamp":1742938865084,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_17","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"249-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing by\u00a0Scheduling: Using Constraint Programming to\u00a0Solve a\u00a0Complex 2D Cutting Stock Problem"],"prefix":"10.1007","author":[{"given":"Yiqing L.","family":"Luo","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-012-9132-0","volume":"18","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On the reification of global constraints. Constraints 18, 1\u20136 (2012)","journal-title":"Constraints"},{"issue":"12","key":"17_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Math. Comput. Model. 20(12), 97\u2013123 (1994)","journal-title":"Math. Comput. Model."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-19212-9_9","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"KEC Booth","year":"2019","unstructured":"Booth, K.E.C., Beck, J.C.: A constraint programming approach to electric vehicle routing with time windows. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 129\u2013145. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_9"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-59776-8_26","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"Q Cappart","year":"2017","unstructured":"Cappart, Q., Schaus, P.: Rescheduling railway traffic on real time situations using time-interval variables. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 312\u2013327. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_26"},{"doi-asserted-by":"crossref","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3), 944\u2013959 (2008). Part Special Issue: New Trends in Locational Analysis","key":"17_CR5","DOI":"10.1016\/j.cor.2006.05.012"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0895-7177(92)90081-U","volume":"16","author":"M Dincbas","year":"1992","unstructured":"Dincbas, M., Simonis, H., Hentenryck, P.V.: Solving a cutting-stock problem with the constraint logic programming language CHIP. Math. Comput. Model. 16, 95\u2013105 (1992)","journal-title":"Math. Comput. Model."},{"issue":"8","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2013.02.026","volume":"40","author":"F Furini","year":"2013","unstructured":"Furini, F., Malaguti, E.: Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput. Oper. Res. 40(8), 1953\u20131962 (2013)","journal-title":"Comput. Oper. Res."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.cie.2017.03.017","volume":"107","author":"R Gedik","year":"2017","unstructured":"Gedik, R., Kirac, E., Milburn, A.B., Rainwater, C.: A constraint programming approach for the team orienteering problem with time windows. Comput. Ind. Eng. 107, 178\u2013195 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Oper. Res. 13(1), 94\u2013120 (1965)","journal-title":"Oper. Res."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cie.2016.11.001","volume":"102","author":"AM Ham","year":"2016","unstructured":"Ham, A.M., Cakici, E.: Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches. Comput. Ind. Eng. 102, 160\u2013165 (2016)","journal-title":"Comput. Ind. Eng."},{"unstructured":"IBM: CP optimizer user manual. https:\/\/www.ibm.com\/docs\/en\/icos\/20.1.0?topic=optimizer-cp-users-manual","key":"17_CR11"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","volume":"289","author":"M Iori","year":"2021","unstructured":"Iori, M., de Lima, V.L., Martello, S., Miyazawa, F.K., Monaci, M.: Exact solution techniques for two-dimensional cutting and packing. Eur. J. Oper. Res. 289(2), 399\u2013415 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-33954-2_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"J Kinable","year":"2016","unstructured":"Kinable, J., van Hoeve, W.-J., Smith, S.F.: Optimization models for a real-world snow plow routing problem. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 229\u2013245. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_17"},{"unstructured":"Kong, V.L.: IBMDecisionOptimization: Docplex-Examples\/Trimloss.py (2020). https:\/\/github.com\/IBMDecisionOptimization\/docplex-examples\/blob\/master\/examples\/cp\/basic\/trimloss.py","key":"17_CR14"},{"unstructured":"Korf, R.E.: Optimal rectangle packing: initial results. In: Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), pp. 287\u2013295. AAAI (2003)","key":"17_CR15"},{"unstructured":"Korf, R.E.: Optimal rectangle packing: new results. In: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 142\u2013149. AAAI (2004)","key":"17_CR16"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"W Ku","year":"2016","unstructured":"Ku, W., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 165\u2013173 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10951-014-0408-7","volume":"19","author":"P Laborie","year":"2016","unstructured":"Laborie, P., Rogerie, J.: Temporal linear relaxation in IBM ILOG CP optimizer. J. Sched. 19(4), 391\u2013400 (2016)","journal-title":"J. Sched."},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM\/ILOG. Constraints 23(2), 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1080\/0740817X.2012.725506","volume":"45","author":"J Lee","year":"2013","unstructured":"Lee, J., Kim, B.I., Johnson, A.L.: A two-dimensional bin packing problem with size changeable items for the production of wind turbine flanges in the open die forging industry. IIE Trans. 45, 1332\u20131344 (2013)","journal-title":"IIE Trans."},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"17_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A Lodi","year":"2003","unstructured":"Lodi, A., Monaci, M.: Integer linear programming models for 2-staged two-dimensional knapsack problems. Math. Program. 94(2\u20133), 257\u2013278 (2003)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Loken, C., et al.: SciNet: lessons learned from building a power-efficient top-20 system and data centre. In: Journal of Physics: Conference Series, vol. 256, p. 012026 (2010)","key":"17_CR23","DOI":"10.1088\/1742-6596\/256\/1\/012026"},{"issue":"6","key":"17_CR24","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.cor.2009.08.005","volume":"37","author":"R Macedo","year":"2010","unstructured":"Macedo, R., Alves, C., de Carvalho, J.M.V.: Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput. Oper. Res. 37(6), 991\u20131001 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"17_CR25","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1016\/j.cor.2011.12.010","volume":"39","author":"M Mesyagutov","year":"2012","unstructured":"Mesyagutov, M., Scheithauer, G., Belov, G.: LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39(10), 2425\u20132438 (2012)","journal-title":"Comput. Oper. Res."},{"unstructured":"Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: a meta-CSP approach. In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, (ICAPS 2006), pp. 93\u2013102. AAAI (2006)","key":"17_CR26"},{"unstructured":"Ponce, M., et al.: Deploying a top-100 supercomputer for large parallel workloads: the Niagara supercomputer. In: Proceedings of the Practice and Experience in Advanced Research Computing on Rise of the Machines (Learning), PEARC 2019, Chicago, IL, USA, 28 July\u201301 August 2019, pp. 34:1\u201334:8. ACM (2019)","key":"17_CR27"},{"key":"17_CR28","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. 3258, pp. 648\u2013662. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_47"},{"doi-asserted-by":"crossref","unstructured":"Silva, E., Alvelos, F., Val\u00e9rio de Carvalho, J.: An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur. J. Oper. Res. 205(3), 699\u2013708 (2010)","key":"17_CR29","DOI":"10.1016\/j.ejor.2010.01.039"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-85958-1_4","volume-title":"Principles and Practice of Constraint Programming","author":"H Simonis","year":"2008","unstructured":"Simonis, H., O\u2019Sullivan, B.: Search strategies for rectangle packing. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 52\u201366. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_4"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-21311-3_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"H Simonis","year":"2011","unstructured":"Simonis, H., O\u2019Sullivan, B.: Almost square packing. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 196\u2013209. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_19"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-030-58942-4_28","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"TY Tang","year":"2020","unstructured":"Tang, T.Y., Beck, J.C.: CP and hybrid models for two-stage batching and scheduling. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 431\u2013446. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_28"},{"issue":"3","key":"17_CR33","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"17_CR34","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.cirp.2018.05.004","volume":"67","author":"D Yang","year":"2018","unstructured":"Yang, D., et al.: Flexibility in metal forming. CIRP Ann. 67(2), 743\u2013765 (2018)","journal-title":"CIRP Ann."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:04:20Z","timestamp":1667912660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}