{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T12:13:26Z","timestamp":1769948006178,"version":"3.49.0"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Joint Funds of the Zhejiang Provincial Natural Science Foundation of China","award":["LZY24E050002"],"award-info":[{"award-number":["LZY24E050002"]}]},{"name":"Quzhou Science and Technology Planning Project","award":["2023K231"],"award-info":[{"award-number":["2023K231"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00500-024-10395-w","type":"journal-article","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T15:43:28Z","timestamp":1733931808000},"page":"195-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Benders decomposition for the multi-agent location and scheduling problem on unrelated parallel machines"],"prefix":"10.1007","volume":"29","author":[{"given":"Jun","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5678-6159","authenticated-orcid":false,"given":"Yongjian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wencan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianwen","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"issue":"2","key":"10395_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(2):229\u2013242","journal-title":"Oper Res"},{"issue":"2","key":"10395_CR2","first-page":"196","volume":"27","author":"S Akbarinasaji","year":"2017","unstructured":"Akbarinasaji S, Mckendall AR (2017) Heuristics for the integrated single machine scheduling and location problem. Int J Ind Syst Eng 27(2):196\u2013209","journal-title":"Int J Ind Syst Eng"},{"issue":"22","key":"10395_CR3","doi-asserted-by":"publisher","first-page":"6750","DOI":"10.1080\/00207543.2021.1923854","volume":"60","author":"D Bai","year":"2022","unstructured":"Bai D, Diabat A, Wang X, Yang D, Fu Y, Zhang Z, Wu C (2022) Competitive bi-agent flow-shop scheduling to minimise the weighted combination of makespans. Int J Prod Res 60(22):6750\u20136771","journal-title":"Int J Prod Res"},{"issue":"1","key":"10395_CR4","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(1):7\u201316","journal-title":"J Sched"},{"issue":"2","key":"10395_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.ejor.2020.03.056","volume":"286","author":"S Belieres","year":"2020","unstructured":"Belieres S, Hewitt M, Jozefowiez N, Semet F, Woensel TV (2020) A Benders decomposition-based approach for logistics service network design. Eur J Oper Res 286(2):523\u2013537","journal-title":"Eur J Oper Res"},{"key":"10395_CR6","doi-asserted-by":"crossref","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4: 238\u2013252","DOI":"10.1007\/BF01386316"},{"issue":"4","key":"10395_CR7","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.cie.2010.12.008","volume":"60","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Cheng S, Wu WH, Hsu P, Wu CC (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput Ind Eng 60(4):534\u2013541","journal-title":"Comput Ind Eng"},{"issue":"2","key":"10395_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1057\/s41274-017-0184-9","volume":"69","author":"H Dkhil","year":"2017","unstructured":"Dkhil H, Yassine A, Chabchoub H (2017) Multi-objective optimization of the integrated problem of location assignment and straddle carrier scheduling in maritime container terminal at import. J Oper Res 69(2):247\u2013269","journal-title":"J Oper Res"},{"key":"10395_CR9","volume-title":"Facility location: applications and theory","year":"2002","unstructured":"Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer, Berlin"},{"key":"10395_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10951-008-0094-4","volume":"12","author":"D Elvikis","year":"2009","unstructured":"Elvikis D, Hamacher HW, Kalsch MT (2009) Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem. J Sched 12:361\u2013374","journal-title":"J Sched"},{"key":"10395_CR11","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS (2023a) An improved Harris Hawks optimization algorithm with multi-strategy for community detection in social network. J Bionic Eng 20:1175\u20131197","DOI":"10.1007\/s42235-022-00303-z"},{"key":"10395_CR12","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS (2023b) Quantum-inspired metaheuristic algorithms: comprehensive survey and classification. Artif Intell Rev 56:5479\u20135543","DOI":"10.1007\/s10462-022-10280-8"},{"key":"10395_CR13","first-page":"16929","volume":"89","author":"FS Gharehchopogh","year":"2024","unstructured":"Gharehchopogh FS, Ibrikci T (2024) An improved African vultures optimization algorithm using different fitness functions for multi-level thresholding image segmentation. Multimed Tools Appl 89:16929\u201316975","journal-title":"Multimed Tools Appl"},{"key":"10395_CR14","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1007\/s11831-023-09883-3","volume":"30","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS, Ucan A, Ibrikci T, Arasteh B, Isik G (2023) Slime mould algorithm: a comprehensive survey of its variants and applications. Arch Comput Methods Eng 30:2683\u20132723","journal-title":"Arch Comput Methods Eng"},{"key":"10395_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10951-017-0546-9","volume":"21","author":"M Gu","year":"2018","unstructured":"Gu M, Gu J, Lu X (2018) An algorithm for multi-agent scheduling to minimize the makespan on $$m$$ parallel machines. J Sched 21:483\u2013492","journal-title":"J Sched"},{"key":"10395_CR16","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11590-018-1298-y","volume":"13","author":"M Gu","year":"2019","unstructured":"Gu M, Lu X, Gu J (2019) An approximation algorithm for multi-agent scheduling on two uniform parallel machines. Optim Lett 13:907\u2013933","journal-title":"Optim Lett"},{"key":"10395_CR17","first-page":"77","volume":"16","author":"HW Hamacher","year":"2007","unstructured":"Hamacher HW, Hennes H (2007) Integrated scheduling and location models: single machine makespan problems. Stud Locat Anal 16:77\u201390","journal-title":"Stud Locat Anal"},{"key":"10395_CR18","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s10878-017-0138-9","volume":"34","author":"C He\u00dfler","year":"2017","unstructured":"He\u00dfler C, Deghdak K (2017) Discrete parallel machine makespan ScheLoc problem. J Comb Optim 34:1159\u20131186","journal-title":"J Comb Optim"},{"key":"10395_CR19","unstructured":"Hennes H, Hamacher HW (2002). Integrated scheduling and location models: single machine makespan problems. Technical Report, University of Kaiserslautern, Shaker Verlag, Aachen"},{"issue":"2","key":"10395_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.cor.2009.04.014","volume":"37","author":"MT Kalsch","year":"2010","unstructured":"Kalsch MT, Drezner Z (2010) Solving scheduling and location problems in the plane simultaneously. Comput Oper Res 37(2):256\u2013264","journal-title":"Comput Oper Res"},{"issue":"4","key":"10395_CR21","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(4):423\u2013434","journal-title":"J Sched"},{"key":"10395_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105318","volume":"132","author":"R Kramer","year":"2021","unstructured":"Kramer R, Kramer A (2021) An exact framework for the discrete parallel machine scheduling location problem. Comput Oper Res 132:105318","journal-title":"Comput Oper Res"},{"issue":"1","key":"10395_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.orl.2019.11.001","volume":"48","author":"SO Krumke","year":"2020","unstructured":"Krumke SO, Le HM (2020) Robust absolute single machine makespan scheduling-location problem on trees. Oper Res Lett 48(1):29\u201332","journal-title":"Oper Res Lett"},{"key":"10395_CR24","doi-asserted-by":"crossref","unstructured":"Labetoulle J, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1984) Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank WR (ed) Progress in combinatorial optimization. Academic Press, pp 245\u2013261","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"10395_CR25","volume-title":"Location science","year":"2015","unstructured":"Laporte G, Nickel S, Saldanha da Gama F (eds) (2015) Location science. Springer, Berlin"},{"key":"10395_CR26","doi-asserted-by":"crossref","unstructured":"\u0141awrynowicz M, Jozefczyk J (2019) A memetic algorithm for the discrete scheduling-location problem with unrelated machines. In: 2019 24th international conference on methods and models in automation and robotics. MMAR, pp 158\u2013163","DOI":"10.1109\/MMAR.2019.8864631"},{"key":"10395_CR27","doi-asserted-by":"crossref","unstructured":"\u0141awrynowicz M, Filcek G (2020) A comparison of evolutionary and simulated annealing algorithms for bi-criteria location-scheduling problem. In: 2020 15th conference on computer science and information systems. FedCSIS, pp 251\u2013255","DOI":"10.15439\/2020F91"},{"issue":"5","key":"10395_CR28","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10951-011-0253-x","volume":"15","author":"S Li","year":"2012","unstructured":"Li S, Yuan J (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15(5):629\u2013640","journal-title":"J Sched"},{"issue":"2","key":"10395_CR29","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1287\/ijoc.2021.1113","volume":"34","author":"Y Li","year":"2021","unstructured":"Li Y, Cote JF, Callegari-Coelho L, Wu P (2021) Novel formulations and logic-based benders decomposition for the integrated parallel machine scheduling and location problem. INFORMS J Comput 34(2):1048\u20131069","journal-title":"INFORMS J Comput"},{"issue":"6","key":"10395_CR30","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1080\/00207543.2018.1504247","volume":"57","author":"M Liu","year":"2019","unstructured":"Liu M, Liu X, Zhang E, Chu F, Chu C (2019) Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem. Int J Prod Res 57(6):1706\u20131723","journal-title":"Int J Prod Res"},{"issue":"1","key":"10395_CR31","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/00207543.2021.1950938","volume":"60","author":"Y Liu","year":"2022","unstructured":"Liu Y, Sun S, Wang XV, Wang L (2022) An iterative combinatorial auction mechanism for multi-agent parallel machine scheduling. Int J Prod Res 60(1):361\u2013380","journal-title":"Int J Prod Res"},{"issue":"3","key":"10395_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/dac.4670","volume":"34","author":"H Mohammadzadeh","year":"2021","unstructured":"Mohammadzadeh H, Gharehchopogh FS (2021) A multi-agent system based for solving high-dimensional optimization problems: a case study on email spam detection. Int J Commun Syst 34(3):e4670","journal-title":"Int J Commun Syst"},{"issue":"3","key":"10395_CR33","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(3):524\u2013531","journal-title":"Eur J Oper Res"},{"key":"10395_CR34","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.cie.2017.07.039","volume":"113","author":"MM Musavi","year":"2017","unstructured":"Musavi MM, Bozorgi-Amiri A (2017) A multi-objective sustainable hub location-scheduling problem for perishable food supply chain. Comput Ind Eng 113:766\u2013778","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10395_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 problem with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"10395_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0910-7","volume-title":"Planning and scheduling in manufacturing and services","author":"ML Pinedo","year":"2009","unstructured":"Pinedo ML (2009) Planning and scheduling in manufacturing and services, 2nd edn. Springer, New York","edition":"2"},{"key":"10395_CR37","volume-title":"Scheduling-theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling-theory, algorithms, and systems, 5th edn. Springer, Berlin","edition":"5"},{"key":"10395_CR38","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.3390\/math10152742","volume":"10","author":"J Piri","year":"2022","unstructured":"Piri J, Mohapatra P, Acharya B, Gharehchopogh FS, Gerogiannis VC, Kanavos A, Manika S (2022) Feature selection using artificial gorilla troop optimization for biomedical data: a case analysis with COVID-19 data. Mathematics 10:2742","journal-title":"Mathematics"},{"issue":"4","key":"10395_CR39","first-page":"573","volume":"7","author":"M Rajabzadeh","year":"2016","unstructured":"Rajabzadeh M, Ziaee M, Bozorgi-Amiri A (2016) Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem. Int J Ind Eng Comput 7(4):573\u2013584","journal-title":"Int J Ind Eng Comput"},{"key":"10395_CR40","unstructured":"Schultz D, Oh SH, Grecas CF, Albani M, Sanchez J, Arbib C, Arvia V, Servilio M, Del Sorbo F, Giralda A, Lombardi F (2022) A QoS concept for packet oriented S-UMTS services, 1st Mobile Summit. Thessaloniki, Greece"},{"issue":"1","key":"10395_CR41","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ejor.2007.06.017","volume":"190","author":"MJ Soomer","year":"2008","unstructured":"Soomer MJ, Franx GJ (2008) Scheduling aircraft landings using airlines preferences. Eur J Oper Res 190(1):277\u2013291","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10395_CR42","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2010.01.005","volume":"205","author":"G Wan","year":"2010","unstructured":"Wan G, Vakati RS, Leung JYT, Pinedo M (2010) Scheduling two agents with controllable processing times. Eur J Oper Res 205(3):528\u2013539","journal-title":"Eur J Oper Res"},{"key":"10395_CR43","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1080\/00207543.2015.1056317","volume":"54","author":"D Wang","year":"2016","unstructured":"Wang D, Yin Y, Cheng SR, Cheng TCE, Wu CC (2016) Due date assignment and scheduling on a single machine with two competing agents. Int J Prod Res 54:1152\u20131169","journal-title":"Int J Prod Res"},{"key":"10395_CR44","doi-asserted-by":"crossref","unstructured":"Wang S, Wu R, Chu F, Yu J, Liu X (2020a) An improved formulation and efficient heuristics for the discrete parallel-machine makespan ScheLoc problem. Comput Ind Eng 140:106238","DOI":"10.1016\/j.cie.2019.106238"},{"key":"10395_CR45","doi-asserted-by":"crossref","unstructured":"Wang D, Yu Y, Qiu H, Yin Y, Cheng TCE (2020b) Two-agent scheduling with linear resource-dependent processing times. Naval Res Logist 67:573\u2013591","DOI":"10.1002\/nav.21936"},{"issue":"12","key":"10395_CR46","doi-asserted-by":"publisher","first-page":"3633","DOI":"10.1080\/00207543.2020.1748908","volume":"59","author":"D Wang","year":"2021","unstructured":"Wang D, Yu Y, Yin Y, Cheng TCE (2021) Multi-agent scheduling problems under multitasking. Int J Prod Res 59(12):3633\u20133663","journal-title":"Int J Prod Res"},{"key":"10395_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100996","volume":"69","author":"X Wang","year":"2022","unstructured":"Wang X, Ren T, Bai D, Ezeh C, Zhang H, Dong Z (2022) Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. Swarm Evol Comput 69:100996","journal-title":"Swarm Evol Comput"},{"key":"10395_CR48","doi-asserted-by":"crossref","unstructured":"Wesolkowski S, Franceti\u0107 N, Grant SC (2014). TraDE: training device selection via multi-objective optimization. In: 2014 IEEE Congress on evolutionary computation. CEC, pp 2617\u20132624","DOI":"10.1109\/CEC.2014.6900566"},{"issue":"2","key":"10395_CR49","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1016\/j.asoc.2012.10.003","volume":"13","author":"CC Wu","year":"2013","unstructured":"Wu CC, Wu WH, Chen JC, Yin Y, Wu WH (2013) A study of the single-machine two-agent scheduling problem with release times. Appl Soft Comput 13(2):998\u20131006","journal-title":"Appl Soft Comput"},{"key":"10395_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108813","volume":"174","author":"P Wu","year":"2022","unstructured":"Wu P, Wang Y, Chu C, Li Y (2022) An improved mixed-integer programming approach for bi-objective parallel machine scheduling and location. Comput Ind Eng 174:108813","journal-title":"Comput Ind Eng"},{"key":"10395_CR51","doi-asserted-by":"crossref","unstructured":"Wu P, Wang Y, Cheng J, Li Y (2023) A biobjective optimization for integrated parallel machine scheduling and location problem: mathematical model and iterative two-stage heuristic. IEEE Trans Syst Man Cybern Syst 53(11):6897\u20136908","DOI":"10.1109\/TSMC.2023.3288904"},{"key":"10395_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106528","volume":"164","author":"P Wu","year":"2024","unstructured":"Wu P, Wang Y, Chu C (2024) Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption. Comput Oper Res 164:106528","journal-title":"Comput Oper Res"},{"issue":"3","key":"10395_CR53","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1016\/j.ejor.2022.06.047","volume":"305","author":"Y Yang","year":"2022","unstructured":"Yang Y, Yin Y, Wang D, Ignatius J, Cheng TCE, Dhamotharan L (2022) Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics. Eur J Oper Res 305(3):1042\u20131062","journal-title":"Eur J Oper Res"},{"issue":"15","key":"10395_CR54","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ins.2011.11.035","volume":"189","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng S, Wu CC (2012) Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penaltie. Inf Sci 189(15):282\u2013292","journal-title":"Inf Sci"},{"key":"10395_CR55","doi-asserted-by":"crossref","unstructured":"Yin Y, Cheng S, Cheng TCE, Wang D, Wu CC (2016a) Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63:41\u201347","DOI":"10.1016\/j.omega.2015.09.010"},{"key":"10395_CR56","doi-asserted-by":"crossref","unstructured":"Yin Y, Wang D, Wu CC, Cheng TCE (2016b) CON\/SLK due date assignment and scheduling on a single machine with two agents. Nav Res Logist 63:416\u2013429","DOI":"10.1002\/nav.21700"},{"key":"10395_CR57","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/nav.21813","volume":"65","author":"Y Yin","year":"2018","unstructured":"Yin Y, Yang Y, Wang D, Cheng TCE, Wu CC (2018) Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Nav Res Logist 65:393\u2013409","journal-title":"Nav Res Logist"},{"key":"10395_CR58","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-018-0583-z","volume":"22","author":"Y Yin","year":"2019","unstructured":"Yin Y, Chen Y, Qin K, Wang D (2019) Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria. J Sched 22:315\u2013333","journal-title":"J Sched"},{"key":"10395_CR59","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1007\/978-981-15-2105-8","volume-title":"Due date-related scheduling with two agents: models and algorithms","author":"Y Yin","year":"2020","unstructured":"Yin Y, Wang D, Cheng TCE (2020) Due date-related scheduling with two agents: models and algorithms. Springer, Singapore, p 2020"},{"key":"10395_CR60","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10479-018-2839-6","volume":"298","author":"Y Yin","year":"2021","unstructured":"Yin Y, Li D, Wang D, Cheng TCE (2021) Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann Oper Res 298:497\u2013523","journal-title":"Ann Oper Res"},{"key":"10395_CR61","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102896","volume":"120","author":"Y Yin","year":"2023","unstructured":"Yin Y, Luo Z, Wang D, Cheng TCE (2023) Wasserstein distance-based distributionally robust parallel-machine scheduling. Omega 120:102896","journal-title":"Omega"},{"issue":"1\u20132","key":"10395_CR62","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/00207543.2023.2230324","volume":"62","author":"Y Yin","year":"2024","unstructured":"Yin Y, Wang J, Chu F, Wang D (2024) Distributionally robust multi-period humanitarian relief network design integrating facility location, supply inventory and allocation, and evacuation planning. Int J Prod Res 62(1\u20132):45\u201370","journal-title":"Int J Prod Res"},{"key":"10395_CR63","doi-asserted-by":"crossref","unstructured":"Zhang YK, Lin WH, Huang MF, Hu XP (2021) Multi-warehouse package consolidation for split orders in online retailing. Eur J Oper Res 289(3):1040\u20131055","DOI":"10.1016\/j.ejor.2019.07.004"},{"key":"10395_CR64","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105936","volume":"147","author":"C Zhang","year":"2022","unstructured":"Zhang C, Li Y, Cao J, Yang Z, Coelho LC (2022) Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. Comput Oper Res 147:105936","journal-title":"Comput Oper Res"},{"key":"10395_CR65","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10951-015-0460-y","volume":"19","author":"K Zhao","year":"2016","unstructured":"Zhao K, Lu X, Gu M (2016) A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines. J Sched 19:21\u201331","journal-title":"J Sched"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10395-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-10395-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10395-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T03:57:10Z","timestamp":1739332630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-10395-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10395"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-10395-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"15 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article 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"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}