{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:09:04Z","timestamp":1750230544772},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00227-2","type":"journal-article","created":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T04:01:29Z","timestamp":1686024089000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Order Scheduling Heuristic to Minimize the Total Collation Delays and the Makespan in High-Throughput Make-to-Order Manufacturing Systems"],"prefix":"10.1007","volume":"4","author":[{"given":"Husam","family":"Dauod","sequence":"first","affiliation":[]},{"given":"Nieqing","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Debiao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jaehee","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Sang Won","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Daehan","family":"Won","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"issue":"3","key":"227_CR1","first-page":"177","volume":"3","author":"F Julien","year":"1990","unstructured":"Julien F, Magazine M (1990) Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management 3(3):177\u2013199","journal-title":"Journal of Manufacturing and Operations Management"},{"issue":"2","key":"227_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s11465-013-0251-0","volume":"8","author":"B Wang","year":"2013","unstructured":"Wang B, Guan Z, Chen Y et al (2013) An assemble-to-order production planning with the integration of order scheduling and mixed-model sequencing. Front Mech Eng 8(2):137\u2013145","journal-title":"Front Mech Eng"},{"issue":"1","key":"227_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00170-016-9123-1","volume":"99","author":"H Dauod","year":"2018","unstructured":"Dauod H, Li D, Yoon SW et al (2018) Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems. Int J Adv Manuf Technol 99(1):73\u201383","journal-title":"Int J Adv Manuf Technol"},{"issue":"14","key":"227_CR4","doi-asserted-by":"publisher","first-page":"4189","DOI":"10.1080\/00207543.2014.985392","volume":"53","author":"D Li","year":"2015","unstructured":"Li D, Yoon SW (2015) A novel fill-time window minimisation problem and adaptive parallel Tabu search algorithm in mail-order pharmacy automation system. Int J Prod Res 53(14):4189\u20134205","journal-title":"Int J Prod Res"},{"issue":"1","key":"227_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00170-015-7555-7","volume":"83","author":"K Mei","year":"2016","unstructured":"Mei K, Li D, Yoon SW et al (2016) Multi-objective optimization of collation delay and makespan in mail-order pharmacy automated distribution system. Int J Adv Manuf Technol 83(1):475\u2013488","journal-title":"Int J Adv Manuf Technol"},{"issue":"7","key":"227_CR6","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1016\/j.cor.2003.12.008","volume":"32","author":"J Yang","year":"2005","unstructured":"Yang J (2005) The complexity of customer order scheduling problems on parallel machines. Comput Oper Res 32(7):1921\u20131939","journal-title":"Comput Oper Res"},{"key":"227_CR7","doi-asserted-by":"crossref","unstructured":"Leung JY, Li H, Pinedo M (2005) Order scheduling models: an overview. Multidisciplinary Scheduling: Theory and Applications. pp 37\u201353","DOI":"10.1007\/0-387-27744-7_3"},{"issue":"5","key":"227_CR8","first-page":"330","volume":"32","author":"I Alharkan","year":"2020","unstructured":"Alharkan I, Saleh M, Ghaleb MA et al (2020) Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server. J King Saud Univ Eng Sci 32(5):330\u2013338","journal-title":"J King Saud Univ Eng Sci"},{"issue":"2","key":"227_CR9","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","volume":"183","author":"BM Lin","year":"2007","unstructured":"Lin BM, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183(2):944\u2013948","journal-title":"Eur J Oper Res"},{"issue":"4","key":"227_CR10","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1080\/00207543.2018.1501166","volume":"57","author":"L Meng","year":"2019","unstructured":"Meng L, Zhang C, Shao X et al (2019) Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines. Int J Prod Res 57(4):1119\u20131145","journal-title":"Int J Prod Res"},{"issue":"3","key":"227_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","volume":"54","author":"CS Sung","year":"1998","unstructured":"Sung CS, Yoon SH (1998) Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int J Prod Econ 54(3):247\u2013255","journal-title":"Int J Prod Econ"},{"issue":"1","key":"227_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-007-0270-5","volume":"159","author":"JYT Leung","year":"2008","unstructured":"Leung JYT, Li H, Pinedo M (2008) Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann Oper Res 159(1):107\u2013123","journal-title":"Ann Oper Res"},{"issue":"4","key":"227_CR13","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/TASE.2015.2456131","volume":"14","author":"Z Shi","year":"2015","unstructured":"Shi Z, Wang L, Liu P et al (2015) Minimizing completion time for order scheduling: formulation and heuristic algorithm. IEEE Trans Autom Sci Eng 14(4):1558\u20131569","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"227_CR14","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","volume":"144","author":"IS Lee","year":"2013","unstructured":"Lee IS (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144(1):128\u2013134","journal-title":"Int J Prod Econ"},{"issue":"8","key":"227_CR15","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"JYT Leung","year":"2007","unstructured":"Leung JYT, Li H, Pinedo M (2007) Scheduling orders for multiple product types to minimize total weighted completion time. Discret Appl Math 155(8):945\u2013970","journal-title":"Discret Appl Math"},{"key":"227_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.cor.2016.09.010","volume":"78","author":"JM Framinan","year":"2017","unstructured":"Framinan JM, Perez-Gonzalez P (2017) New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput Oper Res 78:181\u2013192","journal-title":"Comput Oper Res"},{"issue":"1","key":"227_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TASE.2013.2291899","volume":"12","author":"X Xu","year":"2013","unstructured":"Xu X, Ma Y, Zhou Z et al (2013) Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Trans Autom Sci Eng 12(1):244\u2013257","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"9","key":"227_CR18","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s00170-010-2692-5","volume":"51","author":"YC Choi","year":"2010","unstructured":"Choi YC, Kim YD, Bang JY (2010) Scheduling algorithms for an air conditioner manufacturing system composed of multiple parallel assembly lines. Int J Adv Manuf Technol 51(9):1225\u20131241","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"227_CR19","first-page":"972","volume":"64","author":"Z Guo","year":"2013","unstructured":"Guo Z, Wong WK, Li Z et al (2013) Modeling and pareto optimization of multi-objective order scheduling problems in production planning. Comput Oper Res 64(4):972\u2013986","journal-title":"Comput Oper Res"},{"key":"227_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/9781108347976","volume-title":"Optimization concepts and applications in engineering","author":"AD Belegundu","year":"2019","unstructured":"Belegundu AD, Chandrupatla TR (2019) Optimization concepts and applications in engineering. Cambridge University Press"},{"issue":"2","key":"227_CR21","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"227_CR22","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1080\/07408170304349","volume":"35","author":"GL Vairaktarakis","year":"2003","unstructured":"Vairaktarakis GL, Cai X (2003) The value of processing flexibility in multipurpose machines. IIE Trans 35(8):763\u2013774","journal-title":"IIE Trans"},{"key":"227_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","volume":"73","author":"E Ahmadi","year":"2016","unstructured":"Ahmadi E, Zandieh M, Farrokh M et al (2016) A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73:56\u201366","journal-title":"Comput Oper Res"},{"key":"227_CR24","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.eswa.2016.02.045","volume":"57","author":"N Khader","year":"2016","unstructured":"Khader N, Lashier A, Yoon SW (2016) Pharmacy robotic dispensing and planogram analysis using association rule mining with prescription data. Expert Syst Appl 57:296\u2013310","journal-title":"Expert Syst Appl"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00227-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00227-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00227-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T12:09:20Z","timestamp":1688386160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00227-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00227-2","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,6]]},"assertion":[{"value":"19 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"OrderedList removed","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"49"}}