{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T06:12:09Z","timestamp":1771999929157,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030532611","type":"print"},{"value":"9783030532628","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-53262-8_15","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"179-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes"],"prefix":"10.1007","author":[{"given":"Renan Spencer","family":"Trindade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olinto C. B.","family":"de Ara\u00fajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcia","family":"Fampa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F., Pedroso, J.P.: Bin packing and related problems: general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56\u201367 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.11.009","journal-title":"Comput. Oper. Res."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, F.D.A.: Cutting & packing problems: general arc-flow formulation with graph compression. Ph.D. thesis, Universidade do Porto (2017)","DOI":"10.1016\/j.cor.2015.11.009"},{"issue":"19","key":"15_CR3","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"PY Chang","year":"2004","unstructured":"Chang, P.Y., Damodaran, P., Melouk, S.: Minimizing makespan on parallel batch processing machines. Int. J. Prod. Res. 42(19), 4211\u20134220 (2004). https:\/\/doi.org\/10.1080\/00207540410001711863","journal-title":"Int. J. Prod. Res."},{"issue":"19","key":"15_CR4","doi-asserted-by":"publisher","first-page":"5755","DOI":"10.1080\/00207543.2010.512620","volume":"49","author":"H Chen","year":"2011","unstructured":"Chen, H., Du, B., Huang, G.Q.: Scheduling a batch processing machine with non-identical job sizes: a clustering perspective. Int. J. Prod. Res. 49(19), 5755\u20135778 (2011). https:\/\/doi.org\/10.1080\/00207543.2010.512620","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.asoc.2012.10.021","volume":"13","author":"B Cheng","year":"2013","unstructured":"Cheng, B., Wang, Q., Yang, S., Hu, X.: An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes. Appl. Soft Comput. 13(2), 765\u2013772 (2013). https:\/\/doi.org\/10.1016\/j.asoc.2012.10.021","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"15_CR6","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"Cheng, B., Yang, S., Hu, X., Chen, B.: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl. Math. Model. 36(7), 3161\u20133167 (2012). https:\/\/doi.org\/10.1016\/j.apm.2011.09.061","journal-title":"Appl. Math. Model."},{"issue":"18","key":"15_CR7","doi-asserted-by":"publisher","first-page":"5109","DOI":"10.1080\/00207540802010807","volume":"47","author":"S Chung","year":"2009","unstructured":"Chung, S., Tai, Y., Pearn, W.: Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes. Int. J. Prod. Res. 47(18), 5109\u20135128 (2009). https:\/\/doi.org\/10.1080\/00207540802010807","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1504\/EJIE.2009.023605","volume":"3","author":"P Damodaran","year":"2009","unstructured":"Damodaran, P., Hirani, N.S., Gallego, M.C.V.: Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. Eur. J. Ind. Eng. 3(2), 187 (2009). https:\/\/doi.org\/10.1504\/EJIE.2009.023605","journal-title":"Eur. J. Ind. Eng."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.04.030","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2014.07.039","volume":"240","author":"ZH Jia","year":"2015","unstructured":"Jia, Z.H., Leung, J.Y.T.: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. Eur. J. Oper. Res. 240(3), 649\u2013665 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.07.039","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"AH Kashan","year":"2008","unstructured":"Kashan, A.H., Karimi, B., Jenabi, M.: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput. Oper. Res. 35(4), 1084\u20131098 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.07.005","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.11.039","volume":"275","author":"A Kramer","year":"2019","unstructured":"Kramer, A., Dell\u2019Amico, M., Iori, M.: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur. J. Oper. Res. 275(1), 67\u201379 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.11.039","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992). https:\/\/doi.org\/10.1287\/opre.40.4.764","journal-title":"Oper. Res."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2017.10.008","volume":"266","author":"J Martinovic","year":"2018","unstructured":"Martinovic, J., Scheithauer, G., de Carvalho, J.M.V.: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. 266(2), 458\u2013471 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.10.008","journal-title":"Eur. J. Oper. Res."},{"issue":"9\u201310","key":"15_CR15","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan, M., Sivakumar, A.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int. J. Adv. Manuf. Technol. 29(9\u201310), 990\u20131001 (2006). https:\/\/doi.org\/10.1007\/s00170-005-2585-1","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J.W., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S.J., Rose, O.: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J. Sched. 14(6), 583\u2013599 (2011). https:\/\/doi.org\/10.1007\/s10951-010-0222-9","journal-title":"J. Sched."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1109\/ACCESS.2018.2789678","volume":"6","author":"M Mrad","year":"2018","unstructured":"Mrad, M., Souayah, N.: An arc-flow model for the makespan minimization problem on identical parallel machines. IEEE Access 6, 5300\u20135307 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2789678","journal-title":"IEEE Access"},{"issue":"2","key":"15_CR18","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(2), 228\u2013249 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00153-8","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR19","unstructured":"Tai, Y.: The study on the production scheduling problems for liquid crystal display module assembly factories. Ph.D. thesis, National Chiao Tung University (2008). https:\/\/ir.nctu.edu.tw\/bitstream\/11536\/57924\/1\/381201.pdf"},{"key":"15_CR20","unstructured":"Trindade, R.S.: Modelling batch processing machines problems with symmetry breaking and arc flow formulation. Ph.D. thesis, Universidade Federal do Rio de Janeiro (2019). https:\/\/www.cos.ufrj.br\/index.php\/pt-BR\/publicacoes-pesquisa\/details\/15\/2902"},{"issue":"22","key":"15_CR21","doi-asserted-by":"publisher","first-page":"7031","DOI":"10.1080\/00207543.2018.1424371","volume":"56","author":"RS Trindade","year":"2018","unstructured":"Trindade, R.S., de Ara\u00fajo, O.C.B., Fampa, M.H.C., M\u00fcller, F.M.: Modelling and symmetry breaking in scheduling problems on batch processing machines. Int. J. Prod. Res. 56(22), 7031\u20137048 (2018). https:\/\/doi.org\/10.1080\/00207543.2018.1424371","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"15_CR22","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(7), 1615\u20131635 (1994). https:\/\/doi.org\/10.1080\/00207549408957026","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1111\/j.1475-3995.1998.tb00100.x","volume":"5","author":"JV de Carvalho","year":"1998","unstructured":"de Carvalho, J.V.: Exact solution of cutting stock problems using column generation and branch-and-bound. Int. Trans. Oper. Res. 5(1), 35\u201344 (1998). https:\/\/doi.org\/10.1111\/j.1475-3995.1998.tb00100.x","journal-title":"Int. Trans. Oper. Res."},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JV de Carvalho","year":"1999","unstructured":"de Carvalho, J.V.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86, 629\u2013659 (1999). https:\/\/doi.org\/10.1023\/A:1018952112615","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:09:05Z","timestamp":1710266945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","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":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","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":"24","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":"36% - 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":"2.26","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.85","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}