{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:38:07Z","timestamp":1771389487585,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"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":["J Sched"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10951-024-00812-1","type":"journal-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T16:10:38Z","timestamp":1721751038000},"page":"485-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7319-2996","authenticated-orcid":false,"given":"Tifenn","family":"Rault","sequence":"first","affiliation":[]},{"given":"Faiza","family":"Sadi","sequence":"additional","affiliation":[]},{"given":"Jean-Charles","family":"Billaut","sequence":"additional","affiliation":[]},{"given":"Ameur","family":"Soukhal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"812_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational & Mathematical Organization Theory, 6, 191\u2013217. https:\/\/doi.org\/10.1023\/A:1009637419820","journal-title":"Computational & Mathematical Organization Theory"},{"key":"812_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242. https:\/\/doi.org\/10.1287\/opre.1030.0092","journal-title":"Operations Research"},{"key":"812_CR3","doi-asserted-by":"publisher","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling. Models and algorithms.https:\/\/doi.org\/10.1007\/978-3-642-41880-8","DOI":"10.1007\/978-3-642-41880-8"},{"key":"812_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., & Smith, J. (2003). A multiple-criterion model for machine scheduling. J. Scheduling, 6, 7\u201316. https:\/\/doi.org\/10.1023\/A:1022231419049","journal-title":"J. Scheduling"},{"issue":"1","key":"812_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55\u201367. https:\/\/doi.org\/10.1016\/j.ejor.2008.10.038","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"812_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.ejor.2012.06.035","volume":"223","author":"R Belaid","year":"2012","unstructured":"Belaid, R., Tkindt, V., & Esswein, C. (2012). Scheduling batches in flowshop with limited buffers in the shampoo industry. Eur. J. Oper. Res., 223(2), 560\u2013572. https:\/\/doi.org\/10.1016\/j.ejor.2012.06.035","journal-title":"Eur. J. Oper. Res."},{"key":"812_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"JL Bruno","year":"1974","unstructured":"Bruno, J. L., Coffman, E. G., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Commun. ACM, 17, 382\u2013387.","journal-title":"Commun. ACM"},{"issue":"2","key":"812_CR8","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2017.01.010","volume":"260","author":"B-C Choi","year":"2017","unstructured":"Choi, B.-C., & Park, M.-J. (2017). Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. European Journal of Operational Research, 260(2), 514\u2013519. https:\/\/doi.org\/10.1016\/j.ejor.2017.01.010","journal-title":"European Journal of Operational Research"},{"key":"812_CR9","doi-asserted-by":"publisher","unstructured":"Cordeiro, D., Dutot, P.-F., Mouni\u00e9, G., & Trystram, D. (2011). Tight analysis of relaxed multi-organization scheduling algorithms. Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011, https:\/\/doi.org\/10.1109\/IPDPS.2011.112.","DOI":"10.1109\/IPDPS.2011.112"},{"issue":"1","key":"812_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyzak","year":"1998","unstructured":"Czyzak, P., & Jaszkiewicz, A. (1998). Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7(1), 34\u201347.","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"812_CR11","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., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evolutionary Computation, IEEE Transactions on, 6, 182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"Evolutionary Computation, IEEE Transactions on"},{"key":"812_CR12","first-page":"02","volume":"2","author":"R D\u2019Souza","year":"2010","unstructured":"D\u2019Souza, R., Sekaran, C., & Kandasamy, A. (2010). Improved nsga-ii based on a novel ranking scheme. Journal of Computing, 2, 02.","journal-title":"Journal of Computing"},{"key":"812_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-012-1099-0.","volume":"213","author":"D Elvikis","year":"2014","unstructured":"Elvikis, D., & T\u2019Kindt, V. (2014). Two-agent scheduling on uniform parallel machines with maximum criteria functions. Annals of Operations Research, 213, 79\u201394. https:\/\/doi.org\/10.1007\/s10479-012-1099-0.https:\/\/hal.archives-ouvertes.fr\/hal-01004005.","journal-title":"Annals of Operations Research"},{"key":"812_CR14","unstructured":"Elvikis, D., Hamacher, H., & T\u2019Kindt, V. (2009). Scheduling two interfering job sets on uniform parallel machines with sum and makespan criteria. In 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, pages\u00a0\u2013, Rolduc, Netherlands. https:\/\/hal.archives-ouvertes.fr\/hal-01025649."},{"issue":"1","key":"812_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cor.2012.05.019","volume":"40","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013). Scheduling problems with two competing agents to minimized weighted earliness-tardiness. Computers & Operations Research, 40(1), 109\u2013116. https:\/\/doi.org\/10.1016\/j.cor.2012.05.019","journal-title":"Computers & Operations Research"},{"key":"812_CR16","doi-asserted-by":"publisher","first-page":"10","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. Journal of Scheduling, 21, 10. https:\/\/doi.org\/10.1007\/s10951-017-0546-9","journal-title":"Journal of Scheduling"},{"key":"812_CR17","doi-asserted-by":"publisher","first-page":"06","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. Optimization Letters, 13, 06. https:\/\/doi.org\/10.1007\/s11590-018-1298-y","journal-title":"Optimization Letters"},{"key":"812_CR18","doi-asserted-by":"publisher","unstructured":"Hosni, E., Kolsi, N., Chaari, W.\u00a0L., & Gh\u00e9dira, K. (2022). Efficient resource allocation using a multi-criteria approach and nodes clustering for heterogeneous hadoop cluster. In M.\u00a0Cristani, C.\u00a0Toro, C.\u00a0Zanni-Merk, R.\u00a0J. Howlett, and L.\u00a0C. Jain, editors, Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, Verona, Italy and Virtual Event, 7-9 September 2022, volume 207 of Procedia Computer Science, pages 2794\u20132803. Elsevier. https:\/\/doi.org\/10.1016\/j.procs.2022.09.337.","DOI":"10.1016\/j.procs.2022.09.337"},{"key":"812_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"N Huynh Tuong","year":"2012","unstructured":"Huynh Tuong, N., Soukhal, A., & Billaut, J.-C. (2012). Single-machine multi-agent scheduling problems with a global objective function. Journal of Scheduling, 15, 311\u2013321. https:\/\/doi.org\/10.1007\/s10951-011-0252-y","journal-title":"Journal of Scheduling"},{"key":"812_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/ijoc.1080.0283","volume":"21","author":"R Jans","year":"2009","unstructured":"Jans, R. (2009). Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS Journal on Computing, 21, 123\u2013136. https:\/\/doi.org\/10.1287\/ijoc.1080.0283","journal-title":"INFORMS Journal on Computing"},{"issue":"9","key":"812_CR21","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.ress.2005.11.018","volume":"91","author":"A Konak","year":"2006","unstructured":"Konak, A., Coit, D. W., & Smith, A. E. (2006). Multi-objective optimization using genetic algorithms: A tutorial. Reliability Engineering & System Safety, 91(9), 992\u20131007. https:\/\/doi.org\/10.1016\/j.ress.2005.11.018","journal-title":"Reliability Engineering & System Safety"},{"issue":"2","key":"812_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C., & Cheng, T. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2), 331\u2013342. https:\/\/doi.org\/10.1016\/j.ejor.2006.01.049","journal-title":"European Journal of Operational Research"},{"key":"812_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H Kung","year":"1975","unstructured":"Kung, H., Luccio, F., & Preparata, F. (1975). On finding the maxima of a set of vectors. Journal of the ACM (JACM), 22, 469\u2013476. https:\/\/doi.org\/10.1145\/321906.321910","journal-title":"Journal of the ACM (JACM)"},{"key":"812_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.knosys.2016.05.012","volume":"105","author":"W-C Lee","year":"2016","unstructured":"Lee, W.-C., Wang, J.-Y., & Lin, M.-C. (2016). A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowledge-Based Systems, 105, 68\u201382. https:\/\/doi.org\/10.1016\/j.knosys.2016.05.012","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"812_CR25","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"J Leung","year":"2010","unstructured":"Leung, J., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58(2), 458\u2013469. https:\/\/doi.org\/10.1287\/opre.1090.0744","journal-title":"Operations Research"},{"key":"812_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2017.09.004","volume":"703","author":"D Li","year":"2017","unstructured":"Li, D., & Lu, X. (2017). Two-agent parallel-machine scheduling with rejection. Theoretical Computer Science, 703, 66\u201375. https:\/\/doi.org\/10.1016\/j.tcs.2017.09.004","journal-title":"Theoretical Computer Science"},{"key":"812_CR27","doi-asserted-by":"publisher","first-page":"06","DOI":"10.1007\/s11740-018-0840-1","volume":"12","author":"C-H Liu","year":"2018","unstructured":"Liu, C.-H., Nanthapodej, R., & Hsu, S.-Y. (2018). Scheduling two interfering job sets on parallel machines under peak power constraint. Production Engineering, 12, 06. https:\/\/doi.org\/10.1007\/s11740-018-0840-1","journal-title":"Production Engineering"},{"key":"812_CR28","doi-asserted-by":"publisher","unstructured":"Olariu, S. (1991). An optimal greedy heuristic to color interval graphs. Information Processing Letters, 37(1), 21\u201325. https:\/\/doi.org\/10.1016\/0020-0190(91)90245-D","DOI":"10.1016\/0020-0190(91)90245-D"},{"key":"812_CR29","doi-asserted-by":"crossref","unstructured":"Pei, J., Wei, J., Liao, B., Liu, X., & Pardalos, P. M. (2020). Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent. Annals of Operations Research, 294(1), 191\u2013223. https:\/\/EconPapers.repec.org\/RePEc:spr:annopr:v:294:y:2020:i:1:d:10.1007_s10479-019-03160-y.","DOI":"10.1007\/s10479-019-03160-y"},{"key":"812_CR30","doi-asserted-by":"publisher","unstructured":"Sadi, F., & Soukhal, A. (2017). Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs. Discrete Optimization, 23, 93\u2013104. https:\/\/doi.org\/10.1016\/j.disopt.2017.01.001.https:\/\/hal.archives-ouvertes.fr\/hal-03063865.","DOI":"10.1016\/j.disopt.2017.01.001."},{"key":"812_CR31","doi-asserted-by":"publisher","unstructured":"Sadi, F., Soukhal, A., & Billaut, J.-C. (2014). Solving multi-agent scheduling problems on parallel machines with a global objective function. RAIRO-Oper. Res., 48(2), 255\u2013269. https:\/\/doi.org\/10.1051\/ro\/2014005","DOI":"10.1051\/ro\/2014005"},{"key":"812_CR32","unstructured":"Smith, B., & Dh, H. (2001). Reducing symmetry in a combinatorial design problem. Proceedings of CPAIOR\u201901, 351\u2013359."},{"key":"812_CR33","unstructured":"T\u2019kindt, V., & Billaut, J.-C. (2006). Multicriteria Scheduling: Theory, Models and Algorithms."},{"issue":"3","key":"812_CR34","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, S. R., Leung, J.Y.-T., & Pinedo, M. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205(3), 528\u2013539. https:\/\/doi.org\/10.1016\/j.ejor.2010.01.005","journal-title":"European Journal of Operational Research"},{"key":"812_CR35","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, S., Cheng, E., Wang, D., & Wu, C. (2016). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 63, 41\u201347. https:\/\/doi.org\/10.1016\/j.omega.2015.09.010","journal-title":"Omega"},{"key":"812_CR36","doi-asserted-by":"publisher","first-page":"06","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. Journal of Scheduling, 22, 06. https:\/\/doi.org\/10.1007\/s10951-018-0583-z","journal-title":"Journal of Scheduling"},{"key":"812_CR37","doi-asserted-by":"publisher","first-page":"168781401875610","DOI":"10.1177\/1687814018756103","volume":"10","author":"F Yu","year":"2018","unstructured":"Yu, F., Wen, P., & Yi, S. (2018). A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan. Advances in Mechanical Engineering, 10, 168781401875610. https:\/\/doi.org\/10.1177\/1687814018756103","journal-title":"Advances in Mechanical Engineering"},{"key":"812_CR38","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao, K., & Lu, X. (2013). Approximation schemes for two-agent scheduling on parallel machines. Theoretical Computer Science, 468, 114\u2013121. https:\/\/doi.org\/10.1016\/j.tcs.2012.11.002","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"812_CR39","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/s10878-014-9744-y","volume":"31","author":"K Zhao","year":"2016","unstructured":"Zhao, K., & Lu, X. (2016). Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan. Journal of Combinatorial Optimization, 31(1), 260\u2013278. https:\/\/doi.org\/10.1007\/s10878-014-9744-y","journal-title":"Journal of Combinatorial Optimization"},{"key":"812_CR40","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. Journal of Scheduling, 19, 21\u201331.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00812-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00812-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00812-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:40:56Z","timestamp":1729006856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00812-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,23]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["812"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00812-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,23]]},"assertion":[{"value":"10 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}