{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:10:28Z","timestamp":1743055828535,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576011"},{"type":"electronic","value":"9783030576028"}],"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-57602-8_28","type":"book-chapter","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T01:02:43Z","timestamp":1596934963000},"page":"311-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9770-532X","authenticated-orcid":false,"given":"Long","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4811-1132","authenticated-orcid":false,"given":"Jiajie","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69516-5","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69516-5"},{"key":"28_CR2","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., et al.: Scheduling a batching machine. J. Sched. 1, 31\u201354 (1998)","journal-title":"J. Sched."},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 51(4), 614\u2013628 (2005)","journal-title":"Manag. Sci."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen, Z.L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58(1), 130\u2013148 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ejor.2016.09.009","volume":"258","author":"BY Cheng","year":"2017","unstructured":"Cheng, B.Y., Leung, J.Y.T., Li, K.: Integrated scheduling on a batch machine to minimize production, inventory and distribution costs. Eur. J. Oper. Res. 258(1), 104\u2013112 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"28_CR6","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. Comput. Oper. Res. 29(7), 807\u2013819 (2002)","journal-title":"Comput. Oper. Res."},{"key":"28_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5, 61\u201365 (1986)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2015.06.051","volume":"247","author":"K Li","year":"2015","unstructured":"Li, K., Jia, Z.H., Leung, J.Y.T.: Integrated production and delivery on parallel batching machines. Eur. J. Oper. Res. 247(3), 755\u2013763 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1016\/j.cor.2005.11.011","volume":"34","author":"S Malve","year":"2007","unstructured":"Malve, S., Uzsoy, R.: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Comput. Oper. Res. 34, 3016\u20133028 (2007)","journal-title":"Comput. Oper. Res."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ijpe.2014.05.012","volume":"156","author":"R Ma","year":"2014","unstructured":"Ma, R., Wan, L., Wei, L.J., Yuan, J.J.: Online bounded-batch scheduling to minimize total weighted completion time on parallel machines. Int. J. Prod. Econ. 156, 31\u201338 (2014)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15(1), 102\u2013109 (1968)","journal-title":"Manag. Sci."},{"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":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J Tian","year":"2009","unstructured":"Tian, J., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf. Process. Lett. 109, 1211\u20131215 (2009)","journal-title":"Inf. Process. Lett."},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ejor.2014.09.063","volume":"242","author":"L Wan","year":"2015","unstructured":"Wan, L., Ding, Z.H., Li, Y.P., Chen, Q.Q., Tan, Z.Y.: Scheduling to minimize the maximum total completion time per machine. Eur. J. Oper. Res. 242, 45\u201350 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ijpe.2014.01.009","volume":"150","author":"L Wan","year":"2014","unstructured":"Wan, L., Zhang, A.: Coordinated scheduling on parallel machines with batch delivery. Int. J. Prod. Econ. 150, 199\u2013203 (2014)","journal-title":"Int. J. Prod. Econ."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1016\/S0305-0548(01)00031-4","volume":"29","author":"C-S Wang","year":"2002","unstructured":"Wang, C.-S., Uzsoy, R.: A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput. Oper. Res. 29, 1621\u20131640 (2002)","journal-title":"Comput. Oper. Res."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.cor.2003.11.029","volume":"32","author":"Q Wang","year":"2005","unstructured":"Wang, Q., Batta, R., Szczerba, R.J.: Sequencing the processing of incoming mail to match an outbound truck delivery schedule. Comput. Oper. Res. 32, 1777\u20131791 (2005)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Xu, S., Bean, J.C.: A genetic algorithm for scheduling parallel non-identical batch processing machines. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 143\u2013150 (2007)","key":"28_CR19","DOI":"10.1109\/SCIS.2007.367682"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57602-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:49:38Z","timestamp":1710359378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57602-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576011","9783030576028"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57602-8_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":"9 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","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":"aaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sjxy.zjnu.edu.cn\/AAIM2020\/list.htm","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":"76","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":"39","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":"51% - 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.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":"8.7","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)"}}]}}