{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T22:58:29Z","timestamp":1771023509756,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper studies a single-machine multitasking scheduling problem together with two-agent consideration. The objective is to look for an optimal schedule to minimize the total tardiness of one agent subject to the total completion time of another agent has an upper bound. For this problem, a branch-and-bound method equipped with several dominant properties and a lower bound is exploited to search optimal solutions for small size jobs. Three metaheuristics, cloud simulated annealing algorithm, genetic algorithm, and simulated annealing algorithm, each with three improvement ways, are proposed to find the near-optimal solutions for large size jobs. The computational studies, experiments, are provided to evaluate the capabilities for the proposed algorithms. Finally, statistical analysis methods are applied to compare the performances of these algorithms.<\/jats:p>","DOI":"10.1007\/s40747-021-00355-4","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T15:46:17Z","timestamp":1618501577000},"page":"199-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics"],"prefix":"10.1007","volume":"8","author":[{"given":"Chin-Chia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Ameni","family":"Azzouz","sequence":"additional","affiliation":[]},{"given":"Jia-Yang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jianyou","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Wei-Lun","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Lamjed","family":"Ben Said","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":[[2021,4,15]]},"reference":[{"key":"355_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"355_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut J-C, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling. Springer, Berlin"},{"key":"355_CR3","first-page":"289","volume":"9","author":"M-H Ahmadi-Darani","year":"2018","unstructured":"Ahmadi-Darani M-H, Moslehi G, Reisi-Nafchi M (2018) A two-agent scheduling problem in a two-machine flowshop. Int J Ind Eng Comput 9:289\u2013306","journal-title":"Int J Ind Eng Comput"},{"issue":"3","key":"355_CR4","first-page":"39","volume":"2","author":"G Appasami","year":"2011","unstructured":"Appasami G, Joseph KS (2011) Optimization of operating systems towards green computing. Int J Comb Optim Probl Inform 2(3):39\u201351","journal-title":"Int J Comb Optim Probl Inform"},{"key":"355_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker KR, Smith JC (2003) A multiple criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"issue":"5976","key":"355_CR6","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1126\/science.1183614","volume":"328","author":"S Charron","year":"2010","unstructured":"Charron S, Koechlin E (2010) Divided representation of concurrent goals in the human frontal lobes. Science 328(5976):360\u2013363","journal-title":"Science"},{"key":"355_CR7","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 flowshop problem. Eur J Oper Res 90:227\u2013237","journal-title":"Eur J Oper Res"},{"issue":"8","key":"355_CR8","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Mati Y, Dauz\u00e8re-P\u00e9r\u00e8s S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35(8):2599\u20132616","journal-title":"Comput Oper Res"},{"key":"355_CR9","doi-asserted-by":"publisher","DOI":"10.3389\/fpsyg.2015.01366","author":"R Fischer","year":"2015","unstructured":"Fischer R, Plessow F (2015) Efficient multitasking: parallel versus serial processing of multiple tasks. Front Psychol. https:\/\/doi.org\/10.3389\/fpsyg.2015.01366","journal-title":"Front Psychol"},{"key":"355_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2012","unstructured":"Gerstl E, Mosheiov G (2012) Scheduling problems with two competing agents to minimize weighted earliness-tardiness. Comput Oper Res 40:109\u2013116","journal-title":"Comput Oper Res"},{"key":"355_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s40747-019-00122-6","volume":"6","author":"K Gao","year":"2020","unstructured":"Gao K, Huang Y, Sadollah A, Wang L (2020) A review of energy-efficient scheduling in intelligent production systems. Complex Intell Syst 6:237\u2013249","journal-title":"Complex Intell Syst"},{"issue":"8","key":"355_CR12","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1111\/poms.12331","volume":"24","author":"NG Hall","year":"2015","unstructured":"Hall NG, Leung JY-T, Li CL (2015) The effects of multitasking on operations scheduling. Prod Oper Manag 24(8):1248\u20131265","journal-title":"Prod Oper Manag"},{"key":"355_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.dam.2016.03.018","volume":"208","author":"NG Hall","year":"2016","unstructured":"Hall NG, Leung JY-T, Li C-L (2016) Multitasking via alternate and shared processing: algorithms and complexity. Discrete Appl Math 208:41\u201358","journal-title":"Discrete Appl Math"},{"key":"355_CR14","doi-asserted-by":"crossref","unstructured":"Ho KI-J, Sum J (2017) Scheduling jobs with multitasking and asymmetric switching costs. In: Proceedings of the IEEE international conference on systems, man, and cybernetics (SMC \u201917), Banff Center, Banff, Canada, October 5\u20138, 2017. http:\/\/www.smc2017.org\/SMC2017_Papers\/media\/files\/0184.pdf","DOI":"10.1109\/SMC.2017.8123072"},{"key":"355_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-1-4684-8941-5_21","volume-title":"Adaptive control of ill-defined systems","author":"JH Holland","year":"1984","unstructured":"Holland JH (1984) Genetic algorithms and adaptation. Adaptive control of ill-defined systems. Springer, pp 317\u2013333"},{"key":"355_CR16","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"},{"issue":"4","key":"355_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"SK Iyer","year":"2004","unstructured":"Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593\u2013606","journal-title":"Comput Oper Res"},{"key":"355_CR18","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1080\/00207543.2018.1497312","volume":"57","author":"M Ji","year":"2019","unstructured":"Ji M, Zhang W, Liao L, Cheng TCE, Tan Y (2019) Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int J Prod Res 57:1667\u20131684. https:\/\/doi.org\/10.1080\/00207543.2018.1497312","journal-title":"Int J Prod Res"},{"key":"355_CR19","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.jmsy.2019.11.007","volume":"54","author":"C Kardos","year":"2020","unstructured":"Kardos C, Kov\u00e1cs A, V\u00e1ncza J (2020) A constraint model for assembly planning. J Manuf Syst 54:196\u2013203","journal-title":"J Manuf Syst"},{"issue":"2","key":"355_CR20","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/msom.2013.0464","volume":"16","author":"DS Kc","year":"2014","unstructured":"Kc DS (2014) Does multitasking improve performance? Evidence from the emergency department. Manuf Serv Oper Manag 16(2):168\u2013183","journal-title":"Manuf Serv Oper Manag"},{"key":"355_CR21","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"355_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10951-014-0410-0","volume":"18","author":"MY Kovalyov","year":"2015","unstructured":"Kovalyov MY, Oulamara A, Soukhal A (2015) Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J Sched 18:423\u2013434","journal-title":"J Sched"},{"key":"355_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.compchemeng.2016.11.012","volume":"97","author":"S Lagzi","year":"2017","unstructured":"Lagzi S, Fukasawa R, Ricardez-Sandoval L (2017) A multitasking continuous time formulation for short-term scheduling of operations in multipurpose plants. Comput Chem Eng 97:135\u2013146. https:\/\/doi.org\/10.1016\/j.compchemeng.2016.11.012","journal-title":"Comput Chem Eng"},{"key":"355_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jmsy.2020.02.010","volume":"55","author":"ZH Lai","year":"2020","unstructured":"Lai ZH, Tao W, Leu MC, Yin Z (2020) Smart augmented reality instructional system for mechanical assembly towards worker-centered intelligent manufacturing. J Manuf Syst 55:69\u201381","journal-title":"J Manuf Syst"},{"key":"355_CR25","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1007\/s11096-015-0155-7","volume":"37","author":"VM Lea","year":"2015","unstructured":"Lea VM, Corlett SA, Rodgers RM (2015) Describing interruptions, multi-tasking and task-switching in communitypharmacy: a qualitative study in England. Int J Clin Pharm 37:1086\u20131094","journal-title":"Int J Clin Pharm"},{"key":"355_CR26","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1080\/24725854.2017.1380334","volume":"50","author":"C-L Li","year":"2018","unstructured":"Li C-L, Chong W (2018) Task scheduling with progress control. IISE Trans 50:54\u201361","journal-title":"IISE Trans"},{"issue":"20","key":"355_CR27","doi-asserted-by":"publisher","first-page":"6052","DOI":"10.1080\/00207543.2017.1321804","volume":"55","author":"M Liu","year":"2017","unstructured":"Liu M, Wang S, Zheng F, Chu C (2017) Algorithms for the joint multitasking scheduling and common due date assignment problem. Int J Prod Res 55(20):6052\u20136066","journal-title":"Int J Prod Res"},{"key":"355_CR28","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1002\/nav.21779","volume":"64","author":"S Li","year":"2017","unstructured":"Li S, Cheng TCE, Ng CT, Yuan J (2017) Two-agent scheduling on a single sequential and compatible batching machine. Nav Res Logist 64:628\u2013641","journal-title":"Nav Res Logist"},{"issue":"3&4","key":"355_CR29","doi-asserted-by":"publisher","first-page":"309","DOI":"10.5334\/pb-50-3-4-309","volume":"50","author":"RH Logie","year":"2010","unstructured":"Logie RH, Law A, Trawley W, Nissan J (2010) Multitasking, working memory and remembering intensions. Psychologica Belgica 50(3 & 4):309\u2013326","journal-title":"Psychologica Belgica"},{"key":"355_CR30","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor B, Mosheiov G (2011) Single machine batch scheduling with two competing agents to minimize total flowtime. Eur J Oper Res 215:524\u2013531","journal-title":"Eur J Oper Res"},{"issue":"2","key":"355_CR31","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/993396.993404","volume":"3","author":"J Noguera","year":"2004","unstructured":"Noguera J, Badia RM (2004) Multitasking on reconfigurable architectures: micro architecture support and dynamic scheduling. ACM Trans Embed Comput Syst 3(2):385\u2013406","journal-title":"ACM Trans Embed Comput Syst"},{"issue":"37","key":"355_CR32","first-page":"15583","volume":"106","author":"E Ophir","year":"2009","unstructured":"Ophir E, Nass C, Wagner AD (2009) Cognitive control in media multitaskers. Psychol Cogn Sci 106(37):15583\u201315587","journal-title":"Psychol Cogn Sci"},{"issue":"2","key":"355_CR33","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1037\/0033-2909.116.2.220","volume":"116","author":"HE Pashler","year":"1994","unstructured":"Pashler HE (1994) Dual-task interference in simple tasks: data and theory. Psychol Bull 116(2):220\u2013244. https:\/\/doi.org\/10.1037\/0033-2909.116.2.220","journal-title":"Psychol Bull"},{"key":"355_CR34","unstructured":"Pashler HE (2000) Task switching and multitask performance. In: Control of cognitive processes: attention and performance XVIII, 2000, pp 277\u2013307"},{"issue":"1","key":"355_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"355_CR36","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2014","unstructured":"Pinedo M (2014) Scheduling: theory, algorithms, and systems, 3rd edn. Prentice Hall, Upper Saddle River","edition":"3"},{"key":"355_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/0-306-48056-5_3","volume-title":"Handbook of metaheuristics","author":"C Reeves","year":"2003","unstructured":"Reeves C (2003) Genetic algorithms. Handbook of metaheuristics. Springer, pp 55\u201382"},{"key":"355_CR38","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.actpsy.2016.04.010","volume":"168","author":"J Reissland","year":"2016","unstructured":"Reissland J, Manzey D (2016) Serial or overlapping processing in multitasking as individual preference: effects of stimulus preview on task switching and concurrent dual-task performance. Acta Physiol (Oxf) 168:27\u201340. https:\/\/doi.org\/10.1016\/j.actpsy.2016.04.010","journal-title":"Acta Physiol (Oxf)"},{"issue":"4","key":"355_CR39","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1037\/0096-1523.27.4.763","volume":"27","author":"JS Rubinstein","year":"2001","unstructured":"Rubinstein JS, Meyer DE, Evans JE (2001) Executive control of cognitive processes in task switching. J Exp Psychol Hum Percept Perform 27(4):763\u2013797","journal-title":"J Exp Psychol Hum Percept Perform"},{"key":"355_CR40","first-page":"105","volume":"2008","author":"C Rosen","year":"2008","unstructured":"Rosen C (2008) The myth of multitasking. New ATLANTIS 2008:105\u2013110","journal-title":"New ATLANTIS"},{"key":"355_CR41","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s40747-018-0066-z","volume":"4","author":"GI Sayed","year":"2018","unstructured":"Sayed GI, Hassanien AE (2018) A hybrid SA-MFO algorithm for function optimization and engineering design problems. Complex Intell Syst 4:195\u2013212","journal-title":"Complex Intell Syst"},{"issue":"5","key":"355_CR42","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1287\/mnsc.47.5.647.10481","volume":"47","author":"S Seshadri","year":"2001","unstructured":"Seshadri S, Shapira Z (2001) Managerial allocation of time and effort: the effects of interruptions. Manag Sci 47(5):647\u2013662","journal-title":"Manag Sci"},{"key":"355_CR43","doi-asserted-by":"publisher","unstructured":"Sum J, Ho K (2015) Analysis on the effect of multitasking. In; Proceedings of the IEEE international conference on systems, man, and cybernetics (SMC\u201915), pp 204\u2013209, IEEE, Hong Kong, October 2015. https:\/\/doi.org\/10.1109\/SMC.2015.48","DOI":"10.1109\/SMC.2015.48"},{"key":"355_CR44","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1016\/j.advengsoft.2010.06.004","volume":"41","author":"E Torabzadeh","year":"2010","unstructured":"Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41:1238\u20131243","journal-title":"Adv Eng Softw"},{"key":"355_CR45","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1748908","author":"D Wang","year":"2020","unstructured":"Wang D, Yu Y, Yin Y, Cheng TCE (2020) Multi-agent scheduling problems under multitasking. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2020.1748908","journal-title":"Int J Prod Res"},{"key":"355_CR46","volume-title":"Applied attention theory","author":"CD Wickens","year":"2008","unstructured":"Wickens CD, McCareley JS (2008) Applied attention theory. Erlbaum, Mahwah"},{"key":"355_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-020-00196-7","author":"CC Wu","year":"2020","unstructured":"Wu CC, Lin WC, Zhang XG, Bai DY, Tsai YW, Ren T, Cheng SR (2020) Cloud theory-based simulated annealing for a single- machine past sequence setup scheduling with scenario-dependent processing times. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00196-7","journal-title":"Complex Intell Syst"},{"key":"355_CR48","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/nav.21863","volume":"66","author":"X Xiong","year":"2019","unstructured":"Xiong X, Zhou P, Yin Y, Cheng TCE, Li D (2019) An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Nav Res Logist 66:502\u2013516","journal-title":"Nav Res Logist"},{"key":"355_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00600-5","author":"Y Yang","year":"2020","unstructured":"Yang Y, Yin G, Wang C, Yin Y (2020) Due date assignment and two-agent scheduling under multitasking environment. J Comb Optim. https:\/\/doi.org\/10.1007\/s10878-020-00600-5","journal-title":"J Comb Optim"},{"key":"355_CR50","unstructured":"Yavari S (2018) Machine scheduling for multitask machining. Electronic Theses and Dissertations 2018, p 7409. https:\/\/scholar.uwindsor.ca\/etd\/7409."},{"key":"355_CR51","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Cheng TCE, Wang DJ, Wu C-C (2016) Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63:41\u201347","journal-title":"Omega"},{"key":"355_CR52","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang DJ, Wu C-C, Cheng TCE (2016) CON\/SLK due date assignment and scheduling on a single machine with two agents. Nav Res Logist 63:416\u2013429","journal-title":"Nav Res Logist"},{"key":"355_CR53","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10951-017-0511-7","volume":"20","author":"Y Yin","year":"2017","unstructured":"Yin Y, Cheng TCE, Wang DJ, Wu C-C (2017) Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. J Sched 20:313\u2013335","journal-title":"J Sched"},{"key":"355_CR54","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cie.2017.07.013","volume":"111","author":"Y Yin","year":"2017","unstructured":"Yin Y, Wang WY, Wang DJ, Cheng TCE (2017) Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval. Comput Ind Eng 111:202\u2013215","journal-title":"Comput Ind Eng"},{"issue":"3","key":"355_CR55","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TETC.2014.2348196","volume":"2","author":"F Zhang","year":"2014","unstructured":"Zhang F, Cao J, Tan W, Khan SU, Li K, Zomaya AY (2014) Evolutionary scheduling of dynamic multitasking workloads for big data analytics in elastic cloud. IEEE Trans Emerg Top Comput 2(3):338\u2013351","journal-title":"IEEE Trans Emerg Top Comput"},{"issue":"3","key":"355_CR56","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s10878-016-0017-9","volume":"33","author":"X Zhang","year":"2017","unstructured":"Zhang X, Wang Y (2017) Two-agent scheduling problems on a single-machine to minimize the total weighted late work. J Comb Optim 33(3):945\u2013955","journal-title":"J Comb Optim"},{"key":"355_CR57","first-page":"1","volume":"2017","author":"Z Zhu","year":"2017","unstructured":"Zhu Z, Li J, Chu C (2017) Multitaskingschedulingproblemswithdeteriorationeffect. Math Probl Eng 2017:1\u201310","journal-title":"Math Probl Eng"},{"key":"355_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/itor.12393","volume":"00","author":"Z Zhu","year":"2017","unstructured":"Zhu Z, Liu M, Chu C, Li L (2017) Multitasking scheduling with multiple rate-modifying activities. Int Trans Oper Res 00:1\u201321. https:\/\/doi.org\/10.1111\/itor.12393","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"355_CR59","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1080\/00207543.2016.1208852","volume":"55","author":"Z Zhu","year":"2017","unstructured":"Zhu Z, Zheng F, Chu C (2017) Multitasking scheduling problems with a rate-modifying activity. Int J Prod Res 55(1):296\u2013312","journal-title":"Int J Prod Res"},{"issue":"5","key":"355_CR60","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1111\/itor.12393","volume":"26","author":"ZG Zhu","year":"2019","unstructured":"Zhu ZG, Liu M, Chu CB, Li JL (2019) Multitasking scheduling with multiple rate-modifying activities. Int Trans Oper Res 26(5):1956\u20131976","journal-title":"Int Trans Oper Res"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00355-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T12:46:47Z","timestamp":1675169207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00355-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00355-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,15]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All of the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This paper does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}