{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:16:10Z","timestamp":1742958970786,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_48","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"560-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Jobs in Flexible Flow Shops with s-batching Machines Using Metaheuristics"],"prefix":"10.1007","author":[{"given":"Jens","family":"Rocholl","sequence":"first","affiliation":[]},{"given":"Lars","family":"M\u00f6nch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"5","key":"48_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1080\/07408170108936839","volume":"33","author":"TCE Cheng","year":"2001","unstructured":"Cheng, T.C.E., Kovalyov, M.Y.: Single machine batch scheduling with sequential job processing. IIE Trans. 33(5), 413\u2013420 (2001)","journal-title":"IIE Trans."},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10951-011-0229-x","volume":"14","author":"P Chr\u00e9tienne","year":"2011","unstructured":"Chr\u00e9tienne, P., Haz\u0131r, \u00d6., Kedad-Sidhoum, S.: Integrated batch sizing and scheduling on a single machine. J. Sched. 14, 541\u2013555 (2011)","journal-title":"J. Sched."},{"issue":"1","key":"48_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 5\u201330 (1996)","journal-title":"J. Heuristics"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler, J.W., M\u00f6nch, L.: A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298(1), 1\u201324 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.disopt.2015.02.001","volume":"16","author":"C He","year":"2015","unstructured":"He, C., Lin, H., Lin, Y.: Bounded serial-batching scheduling for minimizing maximum lateness and makespan. Discrete Optim. 16, 70\u201375 (2015)","journal-title":"Discrete Optim."},{"issue":"1","key":"48_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2017.04.050","volume":"263","author":"S Knopp","year":"2017","unstructured":"Knopp, S., Dauz\u00e8re-P\u00e9r\u00e8s, S., Yugma, C.: A batch-oblivious approach for complex job-shop scheduling problems. Eur. J. Oper. Res. 263(1), 50\u201361 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR7","doi-asserted-by":"publisher","unstructured":"M\u00f6nch, L., Fowler, J.W., Mason, S.J.: Production planning and control for semiconductor wafer fabrication facilities: modeling, analysis and systems. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-4472-5","DOI":"10.1007\/978-1-4614-4472-5"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/j.ejor.2006.01.052","volume":"187","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov, G., Oron, D.: A single machine batch scheduling problem with bounded batch size. Eur. J. Oper. Res. 187, 1069\u20131079 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR9","doi-asserted-by":"publisher","unstructured":"Ovacik, I.M., Uzsoy, R.: Decomposition methods for complex factory scheduling problems. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4615-6329-7","DOI":"10.1007\/978-1-4615-6329-7"},{"issue":"2","key":"48_CR10","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"48_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-020-09461-x","volume":"27","author":"E Queiroga","year":"2020","unstructured":"Queiroga, E., Pinheiro, R.G.S., Christ, Q., Subramanian, A., Pessoa, A.A.: Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics 27(3), 353\u2013438 (2020). https:\/\/doi.org\/10.1007\/s10732-020-09461-x","journal-title":"J. Heuristics"},{"issue":"5","key":"48_CR12","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10951-013-0315-3","volume":"17","author":"L Shen","year":"2014","unstructured":"Shen, L., M\u00f6nch, L., Buscher, U.: Simultaneous and iterative approach for parallel machine scheduling with sequence dependent family setups. J. Sched. 17(5), 471\u2013487 (2014)","journal-title":"J. Sched."},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cie.2014.10.010","volume":"78","author":"S Suppiah","year":"2014","unstructured":"Suppiah, S., Omar, M.K.: A hybrid tabu search for batching and sequencing decisions in a single machine environment. Comput. Ind. Eng. 78, 135\u2013147 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"48_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10951-017-0530-4","volume":"21","author":"Y Tan","year":"2017","unstructured":"Tan, Y., M\u00f6nch, L., Fowler, J.W.: A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. J. Sched. 21(2), 209\u2013226 (2017). https:\/\/doi.org\/10.1007\/s10951-017-0530-4","journal-title":"J. Sched."},{"key":"48_CR15","unstructured":"Wall M.: Galib: A C++ library of genetic algorithms components (2017). http:\/\/lancet.mit.edu\/ga\/"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:06:00Z","timestamp":1688198760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"48","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":"17","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":"67% - 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":"3","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)"}}]}}