{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:32:02Z","timestamp":1761989522991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_28","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"431-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["CP and Hybrid Models for Two-Stage Batching and Scheduling"],"prefix":"10.1007","author":[{"given":"Tanya Y.","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1007\/s00170-017-1429-0","volume":"95","author":"A Azami","year":"2018","unstructured":"Azami, A., Demirli, K., Bhuiyan, N.: Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem. Int. J. Adv. Manuf. Technol. 95, 3259\u20133274 (2018)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11493853_10","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"Y Chu","year":"2005","unstructured":"Chu, Y., Xia, Q.: A hybrid algorithm for a class of resource constrained scheduling problems. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 110\u2013124. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11493853_10"},{"key":"28_CR3","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-dentical job sizes: an exact procedure. Comput. Oper. Res. 29, 807\u2013819 (2002)","journal-title":"Comput. Oper. Res."},{"key":"28_CR4","unstructured":"Emde, S., Polten, L., Gendreau, M.: Logic-based benders decomposition for scheduling a batching machine. Discussion paper, CIRRELT, Montreal, Canada (2018)"},{"key":"28_CR5","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, 94\u2013120 (1965)","journal-title":"Oper. Res."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta, J.N.D.: Two-stage, hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39, 359\u2013364 (1988)","journal-title":"J. Oper. Res. Soc."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"5857","DOI":"10.1080\/00207543.2018.1554918","volume":"57","author":"C Hueber","year":"2018","unstructured":"Hueber, C., Fischer, G., Schwingshandl, N., Schledjewski, R.: Production planning optimization for composite aerospace manufacturing. Int. J. Prod. Res. 57, 5857\u20135873 (2018)","journal-title":"Int. J. Prod. Res."},{"key":"28_CR8","unstructured":"IBM: Class IloDistribute, see note. \nhttps:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.9.0\/ilog.odms.cpo.help\/refcppcpoptimizer\/html\/classes\/IloDistribute.html\n\n. Accessed 11 Sept 2019"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-07046-9_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Kosch","year":"2014","unstructured":"Kosch, S., Beck, J.C.: A new MIP model for parallel-batch scheduling with non-identical job sizes. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 55\u201370. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07046-9_5"},{"key":"28_CR10","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., Gueret, C., Rousseau, L.M.: A constraint programming approach for a batch processing problem with non-identical job sizes. Eur. J. Oper. Res. 221, 533\u2013545 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S Melouk","year":"2004","unstructured":"Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int. J. Prod. Econ. 87, 141\u2013147 (2004)","journal-title":"Int. J. Prod. Econ."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L Monch","year":"2011","unstructured":"Monch, L., Fowler, J.W., Dauzere-Peres, S., Mason, S.J., Rose, O.: Scheduling semiconductor manufacturing operations: problems, solution techniques, and future challenges. J. Sched. 14, 583\u2013599 (2011)","journal-title":"J. Sched."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120, 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32, 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:12:48Z","timestamp":1600409568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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":"35% - 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.08","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":"3.08","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)"}}]}}