{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:38Z","timestamp":1740149078002,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"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 Int J"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s12351-023-00809-2","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T07:02:31Z","timestamp":1702364551000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method"],"prefix":"10.1007","volume":"24","author":[{"given":"Chin-Chia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xingong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Danyu","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Ameni","family":"Azzouz","sequence":"additional","affiliation":[]},{"given":"Wen-Hsiang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xin-Rong","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8237-8020","authenticated-orcid":false,"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"issue":"2","key":"809_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219\u2013239","journal-title":"Omega"},{"issue":"3","key":"809_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032","journal-title":"Eur J Oper Res"},{"issue":"2","key":"809_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378","journal-title":"Eur J Oper Res"},{"key":"809_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F Della Croce","year":"1996","unstructured":"Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. Eur J Oper Res 90:227\u2013237","journal-title":"Eur J Oper Res"},{"key":"809_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0305-0483(88)90008-4","volume":"16","author":"P Dileepan","year":"1988","unstructured":"Dileepan P, Sen T (1988) Bicriterion static scheduling research for a single machine. Omega 16:53\u201359","journal-title":"Omega"},{"key":"809_CR6","first-page":"11","volume":"185","author":"E Erel","year":"2007","unstructured":"Erel E, Ghosh JB (2007) Customer order scheduling on a single machine with family setup times: complexity and algorithms. Appl Math Comput 185:11\u201318","journal-title":"Appl Math Comput"},{"key":"809_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan JM, Perez-Gonzalez P, Fernandez-Viagas V (2019) Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures. Eur J Oper Res 273:401\u2013417","journal-title":"Eur J Oper Res"},{"key":"809_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/0305-0483(89)90063-7","volume":"17","author":"TD Fry","year":"1989","unstructured":"Fry TD, Armstrong RD, Lewis H (1989) A framework for single machine multiple objective sequencing research. Omega 17:595\u2013607","journal-title":"Omega"},{"key":"809_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1018913902852","volume":"70","author":"JND Gupta","year":"1997","unstructured":"Gupta JND, Ho JC, van der Veen JA (1997) Single machine hierarchical scheduling with customer orders and multiple job classes. Ann Oper Res 70:127\u2013143","journal-title":"Ann Oper Res"},{"issue":"6","key":"809_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.25130\/tjps.v27i6.763","volume":"27","author":"DA Hassan","year":"2022","unstructured":"Hassan DA, Amiri NM, Ramadan AM (2022) Solving three objectives single-machine scheduling problem using fuzzy multi-objective linear programming. Tikrit J Pure Sci 27(6):82\u201387","journal-title":"Tikrit J Pure Sci"},{"key":"809_CR11","volume-title":"Nonparametric statistical methods","author":"MD Hollander","year":"2014","unstructured":"Hollander MD, Wolfe A, Chicken E (2014) Nonparametric statistical methods, 3rd edn. Wiley, Hoboken","edition":"3"},{"key":"809_CR12","doi-asserted-by":"publisher","first-page":"5055","DOI":"10.1007\/s12351-022-00700-6","volume":"22","author":"MR Hosseinzadeh","year":"2022","unstructured":"Hosseinzadeh MR, Heydari M, Mazdeh MM (2022) Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time. Oper Res Int J 22:5055\u20135105","journal-title":"Oper Res Int J"},{"key":"809_CR13","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cie.2009.02.015","volume":"57","author":"SY Hsu","year":"2009","unstructured":"Hsu SY, Liu CH (2009) Improving the delivery efficiency of the customer order scheduling problem in a job shop. Comput Ind Eng 57:856\u2013866","journal-title":"Comput Ind Eng"},{"key":"809_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat CD, Vecchi MP (1983) Optimization by simulated annealing algorithm. Science 220:671\u2013680","journal-title":"Science"},{"issue":"4","key":"809_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0305-0483(97)00013-3","volume":"25","author":"SC Kim","year":"1997","unstructured":"Kim SC, Bobrowski PM (1997) Scheduling jobs with uncertain setup times and sequence dependency. Omega 25(4):437\u2013447","journal-title":"Omega"},{"key":"809_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0377-2217(00)00286-1","volume":"135","author":"K Klamroth","year":"2001","unstructured":"Klamroth K, Wiecek MM (2001) A time-dependent multiple criteria single-machine scheduling problem. Eur J Oper Res 135:17\u201326","journal-title":"Eur J Oper Res"},{"key":"809_CR17","doi-asserted-by":"crossref","unstructured":"Kovalenko YV, Zakharov AO (2020) The Pareto set reduction in bicriteria customer order scheduling on a single machine with setup times. In: Journal of physics: conference series, IOP Publishing. p 012087","DOI":"10.1088\/1742-6596\/1546\/1\/012087"},{"issue":"3","key":"809_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0925-5273(96)00105-3","volume":"51","author":"MM Liaee","year":"1997","unstructured":"Liaee MM, Emmons H (1997) Scheduling families of jobs with setup times. Int J Prod Econ 51(3):165\u2013176","journal-title":"Int J Prod Econ"},{"key":"809_CR19","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/0305-0548(93)90057-P","volume":"20","author":"CJ Liao","year":"1993","unstructured":"Liao CJ (1993) Tradeoff between setup times and carrying costs for finished items. Comput Oper Res 20:697\u2013705","journal-title":"Comput Oper Res"},{"issue":"2","key":"809_CR20","first-page":"265","volume":"14","author":"LY Li","year":"2023","unstructured":"Li LY, Lin WC, Bai D, Zhang X, Azzouz A, Cheng SR, Wu YL, Wu CC (2023) Composite heuristics and water wave optimality algorithms for tricriteria multiple job classes and customer order scheduling on a single machine. Int J Ind Eng Comput 14(2):265\u2013274","journal-title":"Int J Ind Eng Comput"},{"key":"809_CR21","first-page":"58","volume":"222","author":"BMT Lin","year":"2013","unstructured":"Lin BMT, Yin PY, Liu YS (2013) Sequence-dependent scheduling with order deliveries. Appl Math Comput 222:58\u201371","journal-title":"Appl Math Comput"},{"issue":"2","key":"809_CR22","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","volume":"183","author":"BMT Lin","year":"2007","unstructured":"Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of tardy jobs. Eur J Oper Res 183(2):944\u2013948","journal-title":"Eur J Oper Res"},{"key":"809_CR23","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1051\/ro\/2023056","volume":"57","author":"WC Lin","year":"2023","unstructured":"Lin WC, Zhang X, Liu X, Hu KX, Cheng SR, Azzouz A, Wu CC (2023) Sequencing single machine multiple-class customer order jobs using heuirstics and improved simulated annealing algorithms. RAIRO Op Res 57:1417\u20131441","journal-title":"RAIRO Op Res"},{"issue":"9","key":"809_CR24","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1080\/09511920902866104","volume":"22","author":"CH Liu","year":"2009","unstructured":"Liu CH (2009) Lot streaming for customer order scheduling problem in job shop environments. Int J Comput Integr Manuf 22(9):890\u2013907","journal-title":"Int J Comput Integr Manuf"},{"key":"809_CR25","doi-asserted-by":"publisher","first-page":"7831","DOI":"10.1016\/j.eswa.2010.04.055","volume":"37","author":"CH Liu","year":"2010","unstructured":"Liu CH (2010) A coordinated scheduling system for customer orders scheduling problem in job shop environments. Expert Syst Appl 37:7831\u20137837","journal-title":"Expert Syst Appl"},{"key":"809_CR26","first-page":"124543","volume":"387","author":"J Qian","year":"2020","unstructured":"Qian J, Lin H, Kong Y, Wang Y (2020) Tri-criteria single machine scheduling model with release times and learning factor. Appl Math Comput 387:124543","journal-title":"Appl Math Comput"},{"issue":"4","key":"809_CR27","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/TASE.2015.2456131","volume":"14","author":"Z Shi","year":"2017","unstructured":"Shi Z, Wang L, Liu P, Shi L (2017) 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\u20132","key":"809_CR28","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1080\/00207543.2017.1401247","volume":"56","author":"Z Shi","year":"2018","unstructured":"Shi Z, Huang Z, Shi L (2018) Customer order scheduling on batch processing machines with incompatible job families. Int J Prod Res 56(1\u20132):795\u2013808","journal-title":"Int J Prod Res"},{"key":"809_CR29","doi-asserted-by":"publisher","first-page":"5951","DOI":"10.1016\/j.eswa.2010.02.009","volume":"37","author":"R Soltani","year":"2010","unstructured":"Soltani R, Jolai F, Zandieh M (2010) Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria. Expert Syst Appl 37:5951\u20135959","journal-title":"Expert Syst Appl"},{"key":"809_CR30","first-page":"030026\u20131","volume":"2095","author":"T Suma","year":"2019","unstructured":"Suma T, Murugesan R (2019) Mathematical model and heuristic based subtask scheduling algorithm for order scheduling. AIP Conf Proc 2095:030026-1\u2013030026-9","journal-title":"AIP Conf Proc"},{"issue":"2","key":"809_CR31","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.ejor.2005.03.033","volume":"174","author":"C Suerie","year":"2006","unstructured":"Suerie C (2006) Modeling of period overlapping setup times. Eur J Oper Res 174(2):874\u2013886","journal-title":"Eur J Oper Res"},{"key":"809_CR32","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C Suerie","year":"2003","unstructured":"Suerie C, Stadtler H (2003) The capacitated lot-sizing problem with linked lot-sizes. Manag Sci 49:1039\u20131054","journal-title":"Manag Sci"},{"issue":"9","key":"809_CR33","doi-asserted-by":"publisher","first-page":"2572","DOI":"10.1080\/00207543.2015.1101176","volume":"54","author":"DP van Donk","year":"2016","unstructured":"van Donk DP, van Doorne R (2016) The impact of the customer order decoupling point on type and level of supply chain Integration. Int J Prod Res 54(9):2572\u20132584","journal-title":"Int J Prod Res"},{"issue":"1","key":"809_CR34","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TASE.2013.2291899","volume":"12","author":"X Xu","year":"2015","unstructured":"Xu X, Ma Y, Zhou Z, Zhao Y (2015) 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":"2","key":"809_CR35","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/002077299292498","volume":"30","author":"WH Yang","year":"1999","unstructured":"Yang WH (1999) Survey of scheduling research involving setup times. Int J Syst Sci 30(2):143\u2013155","journal-title":"Int J Syst Sci"},{"issue":"1","key":"809_CR36","first-page":"95","volume":"17","author":"J Yang","year":"2011","unstructured":"Yang J (2011) Customer order scheduling in a two machine flowshop. Int J Manag Sci 17(1):95\u2013116","journal-title":"Int J Manag Sci"},{"key":"809_CR37","first-page":"665","volume":"15","author":"L Yedidsion","year":"2012","unstructured":"Yedidsion L (2012) Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine. J Sched 15:665\u2013679","journal-title":"J Sched"},{"issue":"1","key":"809_CR38","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/00207543.2020.1842938","volume":"61","author":"KC Ying","year":"2020","unstructured":"Ying KC, Pourhejazy P, Cheng CY, Syu RS (2020) Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. Int J Prod Res 61(1):258\u2013281","journal-title":"Int J Prod Res"},{"key":"809_CR39","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1287\/mnsc.33.10.1209","volume":"33","author":"WI Zangwill","year":"1987","unstructured":"Zangwill WI (1987) From EOQ towards ZI. Manag Sci 33:1209\u20131223","journal-title":"Manag Sci"},{"issue":"7","key":"809_CR40","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1080\/00207543.2017.1381348","volume":"56","author":"Y Zhao","year":"2018","unstructured":"Zhao Y, Xu X, Li H, Liu Y (2018) Stochastic customer order scheduling with setup times to minimize expected cycle time. Int J Prod Res 56(7):2684\u20132706","journal-title":"Int J Prod Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00809-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-023-00809-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00809-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T19:51:46Z","timestamp":1710273106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-023-00809-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,12]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s12351-023-00809-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2023,12,12]]},"assertion":[{"value":"26 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are none.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}