{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:13:20Z","timestamp":1740158000002,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T00:00:00Z","timestamp":1645920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T00:00:00Z","timestamp":1645920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671090"],"award-info":[{"award-number":["71671090"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NP2020022"],"award-info":[{"award-number":["NP2020022"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72171116","71871117"],"award-info":[{"award-number":["72171116","71871117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s12652-022-03759-3","type":"journal-article","created":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T14:02:25Z","timestamp":1645970545000},"page":"12099-12118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online single batch machine scheduling with linear setup times and incompatible jobs for autoclave molding manufacturing"],"prefix":"10.1007","volume":"14","author":[{"given":"Shaoxiang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Naiming","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Qiao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Liangyan","family":"Tao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,27]]},"reference":[{"key":"3759_CR1","doi-asserted-by":"publisher","unstructured":"Acebes L, Merino A, Rodriguez A et al (2019) Model based online scheduling of concurrent and equal batch process units: sugar end industrial case study. J Process Control 80:1\u201314 https:\/\/doi.org\/10.1016\/j.jprocont.2019.05.005 , https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0959152418301835","DOI":"10.1016\/j.jprocont.2019.05.005"},{"key":"3759_CR2","doi-asserted-by":"publisher","unstructured":"Aytug H, Lawley MA, McKay K et al (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161(1):86\u2013110 https:\/\/doi.org\/10.1016\/j.ejor.2003.08.027, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703005307","DOI":"10.1016\/j.ejor.2003.08.027"},{"key":"3759_CR3","doi-asserted-by":"publisher","unstructured":"Babaee Tirkolaee E, Goli A, Weber GW (2020) Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option. IEEE Trans Fuzzy Syst 28(11):2772\u20132783 https:\/\/doi.org\/10.1109\/TFUZZ.2020.2998174, https:\/\/ieeexplore.ieee.org\/document\/9103073\/","DOI":"10.1109\/TFUZZ.2020.2998174"},{"key":"3759_CR4","doi-asserted-by":"publisher","unstructured":"Christensen HI, Khan A, Pokutta S et al (2017) Approximation and online algorithms for multidimensional bin packing: a survey. Comput Sci Rev 24:63\u201379 https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013716301356","DOI":"10.1016\/j.cosrev.2016.12.001"},{"issue":"3","key":"3759_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/09511929208944524","volume":"5","author":"LK Church","year":"1992","unstructured":"Church LK, Uzsoy R (1992) Analysis of periodic and event-driven rescheduling policies in dynamic shops. Int J Comput Integr Manuf 5(3):153\u2013163. https:\/\/doi.org\/10.1080\/09511929208944524","journal-title":"Int J Comput Integr Manuf"},{"key":"3759_CR6","doi-asserted-by":"publisher","unstructured":"Coppersmith D, Raghavan P (1989) Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper Res Lett 8(1):17\u201320 https:\/\/doi.org\/10.1016\/0167-6377(89)90027-8, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637789900278","DOI":"10.1016\/0167-6377(89)90027-8"},{"key":"3759_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.cie.2019.01.038","volume":"129","author":"NCO da Silva","year":"2019","unstructured":"da Silva NCO, Scarpin CT, P\u00e9cora JE et al (2019) Online single machine scheduling with setup times depending on the jobs sequence. Comput Ind Eng 129:251\u2013258","journal-title":"Comput Ind Eng"},{"key":"3759_CR8","doi-asserted-by":"publisher","unstructured":"Epstein L (2010) Two-dimensional online bin packing with rotation. Theor Comput Sci 411(31\u201333):2899\u20132911 https:\/\/doi.org\/10.1016\/j.tcs.2010.04.021, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397510002161","DOI":"10.1016\/j.tcs.2010.04.021"},{"key":"3759_CR9","doi-asserted-by":"publisher","unstructured":"Fang Y, Lu X (2016) Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine. Inf Process Lett 116(8):526\u2013531 https:\/\/doi.org\/10.1016\/j.ipl.2016.03.010, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019016300345","DOI":"10.1016\/j.ipl.2016.03.010"},{"key":"3759_CR10","doi-asserted-by":"publisher","unstructured":"Fang Y, Lu X, Liu P (2011) Online batch scheduling on parallel machines with delivery times. Theor Comput Sci 412(39):5333\u20135339 https:\/\/doi.org\/10.1016\/j.tcs.2011.06.011, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511005044","DOI":"10.1016\/j.tcs.2011.06.011"},{"key":"3759_CR11","doi-asserted-by":"publisher","unstructured":"Fu R, Cheng T, Ng C et al (2013) An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper Res Lett 41(3):216\u2013219 https:\/\/doi.org\/10.1016\/j.orl.2013.01.003, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637713000047","DOI":"10.1016\/j.orl.2013.01.003"},{"issue":"4","key":"3759_CR12","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1007\/s10878-017-0139-8","volume":"34","author":"R Fu","year":"2017","unstructured":"Fu R, Tian J, Li S et al (2017) An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J Comb Optim 34(4):1187\u20131197. https:\/\/doi.org\/10.1007\/s10878-017-0139-8","journal-title":"J Comb Optim"},{"issue":"2","key":"3759_CR13","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S0304-3975(01)00410-8","volume":"289","author":"S Fujita","year":"2002","unstructured":"Fujita S, Hada T (2002) Two-dimensional on-line bin packing problem with rotatable items. Theor Comput Sci 289(2):939\u201352","journal-title":"Theor Comput Sci"},{"issue":"6","key":"3759_CR14","doi-asserted-by":"publisher","first-page":"3917","DOI":"10.1007\/s10489-020-01843-9","volume":"51","author":"F Hossein Nia Shavaki","year":"2021","unstructured":"Hossein Nia Shavaki F, Jolai F (2021) A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers. Appl Intell 51(6):3917\u20133935. https:\/\/doi.org\/10.1007\/s10489-020-01843-9","journal-title":"Appl Intell"},{"key":"3759_CR15","doi-asserted-by":"publisher","unstructured":"Iori M, de Lima VL, Martello S et al (2021) Exact solution techniques for two-dimensional cutting and packing. Eur J Oper Res 289(2):399\u2013415 https:\/\/doi.org\/10.1016\/j.ejor.2020.06.050, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221720306111","DOI":"10.1016\/j.ejor.2020.06.050"},{"issue":"1","key":"3759_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/002075497196082","volume":"35","author":"AK Jain","year":"1997","unstructured":"Jain AK, Elmaraghy H (1997) Production scheduling\/rescheduling in flexible manufacturing. Int J Prod Res 35(1):281\u2013309. https:\/\/doi.org\/10.1080\/002075497196082","journal-title":"Int J Prod Res"},{"issue":"4","key":"3759_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1080\/00207721.2013.794904","volume":"46","author":"W Li","year":"2015","unstructured":"Li W, Li S (2015) Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs. Int J Syst Sci 46(4):652\u2013661. https:\/\/doi.org\/10.1080\/00207721.2013.794904","journal-title":"Int J Syst Sci"},{"issue":"5","key":"3759_CR18","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s10845-014-0874-y","volume":"26","author":"D Li","year":"2015","unstructured":"Li D, Meng X, Liang Q et al (2015) A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. J Intell Manuf 26(5):873\u2013890. https:\/\/doi.org\/10.1007\/s10845-014-0874-y","journal-title":"J Intell Manuf"},{"issue":"2","key":"3759_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s11590-017-1113-1","volume":"12","author":"W Li","year":"2018","unstructured":"Li W, Li S, Feng Q (2018) Online batch scheduling with kind release times and incompatible families to minimize makespan. Optim Lett 12(2):301\u2013310. https:\/\/doi.org\/10.1007\/s11590-017-1113-1","journal-title":"Optim Lett"},{"issue":"10","key":"3759_CR20","doi-asserted-by":"publisher","first-page":"960","DOI":"10.3390\/math7100960","volume":"7","author":"W Li","year":"2019","unstructured":"Li W, Zhai W, Chai X (2019) Online Bi-criteria scheduling on batch machines with machine costs. Mathematics 7(10):960. https:\/\/doi.org\/10.3390\/math7100960","journal-title":"Mathematics"},{"key":"3759_CR21","first-page":"8","volume":"153","author":"R Ma","year":"2014","unstructured":"Ma R (2014) Online bounded-batch scheduling to minimize total weighted completion time on parallel machines. Int J Prod Econ 153:8","journal-title":"Int J Prod Econ"},{"issue":"6","key":"3759_CR22","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1023\/B:JIMS.0000042664.94495.26","volume":"15","author":"M Mathirajan","year":"2004","unstructured":"Mathirajan M, Sivakumar AI, Chandru V (2004) Scheduling algorithms for heterogeneous batch processors with incompatible job-families. J Intell Manuf 15(6):787\u2013803. https:\/\/doi.org\/10.1023\/B:JIMS.0000042664.94495.26","journal-title":"J Intell Manuf"},{"issue":"3","key":"3759_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"SS Seiden","year":"2003","unstructured":"Seiden SS, van Stee R (2003) New bounds for multidimensional packing. Algorithmica 36(3):261\u2013293. https:\/\/doi.org\/10.1007\/s00453-003-1016-7","journal-title":"Algorithmica"},{"key":"3759_CR24","doi-asserted-by":"publisher","unstructured":"Shavaki FH, Jolai F (2021) Formulating and solving the integrated online order batching and delivery planning with specific due dates for orders. J Intell Fuzzy Syst 40(3):4877\u20134903 https:\/\/doi.org\/10.3233\/JIFS-201690, https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/JIFS-201690","DOI":"10.3233\/JIFS-201690"},{"key":"3759_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-020-01597-8","author":"B Su","year":"2020","unstructured":"Su B, Xie N, Yang Y (2020) Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-020-01597-8","journal-title":"J Intell Manuf"},{"key":"3759_CR26","doi-asserted-by":"publisher","unstructured":"Tian J, Fu R, Yuan J (2011) An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf Process Lett 111(21\u201322):1048\u20131053 https:\/\/doi.org\/10.1016\/j.ipl.2011.08.003, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019011002249","DOI":"10.1016\/j.ipl.2011.08.003"},{"key":"3759_CR27","doi-asserted-by":"publisher","unstructured":"Tian J, Cheng T, Ng C et al (2012) An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discret Appl Math 160(7\u20138):1191\u20131210 https:\/\/doi.org\/10.1016\/j.dam.2011.12.002, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X11004902","DOI":"10.1016\/j.dam.2011.12.002"},{"key":"3759_CR28","doi-asserted-by":"publisher","unstructured":"Tian J, Wang Q, Fu R et al (2016) Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor Comput Sci 617:65\u201368 https:\/\/doi.org\/10.1016\/j.tcs.2016.01.001, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516000025","DOI":"10.1016\/j.tcs.2016.01.001"},{"issue":"04","key":"3759_CR29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1142\/S0219686719500355","volume":"18","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee EB, Mahmoodkhani J, Bourani MR et al (2019) A self-learning particle swarm optimization for robust multi-echelon capacitated location-allocation-inventory problem. J Adv Manuf Syst 18(04):677\u2013694. https:\/\/doi.org\/10.1142\/S0219686719500355","journal-title":"J Adv Manuf Syst"},{"issue":"2","key":"3759_CR30","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2789149.2789167","volume":"46","author":"R van Stee","year":"2015","unstructured":"van Stee R (2015) SIGACT news online algorithms column 26: bin packing in multiple dimensions. ACM SIGACT News 46(2):8","journal-title":"ACM SIGACT News"},{"key":"3759_CR31","doi-asserted-by":"publisher","unstructured":"Wang Q, Tian J, Fu R et al (2017) Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs. Theor Comput Sci 700:37\u201344 https:\/\/doi.org\/10.1016\/j.tcs.2017.07.022, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517305704","DOI":"10.1016\/j.tcs.2017.07.022"},{"key":"3759_CR32","doi-asserted-by":"publisher","unstructured":"Wei L, Hu Q, Leung SC et al (2017) An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput Oper Res 80:113\u2013127 https:\/\/doi.org\/10.1016\/j.cor.2016.11.024, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054816302982","DOI":"10.1016\/j.cor.2016.11.024"},{"key":"3759_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-020-01678-8","author":"Q Yu","year":"2020","unstructured":"Yu Q, Yang H, Lin KY et al (2020) A self-organized approach for scheduling semiconductor manufacturing systems. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-020-01678-8","journal-title":"J Intell Manuf"},{"key":"3759_CR34","doi-asserted-by":"publisher","unstructured":"Zhang J, Wang X, Huang K (2016) Integrated on-line scheduling of order batching and delivery under B2C e-commerce. Comput Ind Eng 94:280\u2013289 https:\/\/doi.org\/10.1016\/j.cie.2016.02.001, https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835216300171","DOI":"10.1016\/j.cie.2016.02.001"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-03759-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-022-03759-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-03759-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T16:26:05Z","timestamp":1690215965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-022-03759-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,27]]},"references-count":34,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["3759"],"URL":"https:\/\/doi.org\/10.1007\/s12652-022-03759-3","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2022,2,27]]},"assertion":[{"value":"30 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}