{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:14Z","timestamp":1759847174808},"reference-count":31,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1051\/ro\/2014005","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T15:15:39Z","timestamp":1394205339000},"page":"255-269","source":"Crossref","is-referenced-by-count":14,"title":["Solving multi-agent scheduling problems on parallel machines with a global objective function"],"prefix":"10.1051","volume":"48","author":[{"given":"F.","family":"Sadi","sequence":"first","affiliation":[]},{"given":"A.","family":"Soukhal","sequence":"additional","affiliation":[]},{"given":"J.-C.","family":"Billaut","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,3,7]]},"reference":[{"key":"R1","unstructured":"Agnetis A., Mirchandani P., Pacciarelli D. and Pacifici A., Nondominated schedules for a job-shop with two competing users.Comput. Math. Organ. Theor.6(2000) 191\u2013217."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Agnetis A., Pacciarelli D. and Pacifici A., Multi-agent sincle machine scheduling.Ann. Oper. Res.150(2007) 3\u201315.","DOI":"10.1007\/s10479-006-0164-y"},{"key":"R3","unstructured":"Agnetis A., Mirchandani P., Pacciarelli D. and Pacifici A., Scheduling problems with two competing agents.Oper. Res.52(2004) 229\u2013242."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Agnetis A., Pascale G. and Pacciarelli D., A Lagrangian approach to single-machine scheduling problems with two competing agents.J. Scheduling12(2010) 401\u2013415.","DOI":"10.1007\/s10951-008-0098-0"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Baker K.R. and Smith J.C., A multiple-criteria model for machine scheduling.J. Scheduling6(2003) 7\u201316.","DOI":"10.1023\/A:1022231419049"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Balasubramanian H., Fowler J., Keha A. and Pfund M., Scheduling interfering job sets on parallel machines.Eur. J. Oper. Res.199(2009) 55\u201367.","DOI":"10.1016\/j.ejor.2008.10.038"},{"key":"R7","unstructured":"J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz,Handbook on scheduling: From Theory to Applications. International handbooks on information systems. Springer (2007)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"P. Brucker,Scheduling algorithms. Fifth Edition. Springer (2005).","DOI":"10.1007\/978-3-540-24804-0"},{"key":"R9","unstructured":"Cheng T.C.E., Ng C.T., Yuan J.-J., Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.Theor. Comput. Sci.362(2006) 273\u2013281."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Cheng T.C.E., Ng C.T. and Yuan J.-J., Multi-agent scheduling on a single machine with max-form criteria.Eur. J. Oper. Res.188(2008) 603\u2013609.","DOI":"10.1016\/j.ejor.2007.04.040"},{"key":"R11","unstructured":"Cheng T.C.E., Cheng S.-R., Wu W.-H., Hsu P.-H. and Wu C.-C., A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations.Comput. Ind. Engrg.60(2001) 534\u2013541."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Cho Y. and Sahni S., Preemptive scheduling of independent jobs with release and due times on open, flow and job shops.Oper. Res.29(1981) 511\u2013522.","DOI":"10.1287\/opre.29.3.511"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"D. Cordeiro, P.-F. Dutot, G. Mouni\u00e9 and D. Trystram, Tight Analysis of Relaxed Multi-Organization Scheduling Algorithms. In Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), Anchorage, AL, USA,IEEE Comput. Soc.(2011) 1177\u20131186.","DOI":"10.1109\/IPDPS.2011.112"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Elvikis D., Hamacher H.W. and T\u2019kindt V., Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions.J. Scheduling14(2011) 471\u2013481.","DOI":"10.1007\/s10951-010-0201-1"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"D. Elvikis and V. T\u2019kindt, Two-agent scheduling on uniform parallel machines with min-max criteria.Ann. Oper. Res.(2012) 1\u201316.","DOI":"10.1007\/s10479-012-1099-0"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Graham R.L., Lawler E.L., Lenstra J.K. and Rinnooy Kan A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey.Ann. Discrete Math.5(1979) 287\u2013326.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"R17","unstructured":"Hoogeveen H., Multicriteria scheduling.Eur. J. Oper. Res.167(2005) 59\u2013623."},{"key":"R18","unstructured":"Hopcroft J.E. and Karp R.-M., An5\/2algorithm for maximum matchings in bipartite graphs.SIAM J. Comput.2(1973) 22\u2013231."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Huynh Tuong N., Soukhal A. and Billaut J.-C., Single-machine multi-agent scheduling problems with a global objective function.J. Scheduling15(2012) 311\u2013321.","DOI":"10.1007\/s10951-011-0252-y"},{"key":"R20","unstructured":"Lawler E.L., Optimal sequencing of a single machine subject to precedence constraints.Manage. Sci.19(1973) 544\u2013546."},{"key":"R21","unstructured":"Lee K., Choi B.-C., Leung J.Y.-T. and Pinedo M., Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.Inform. Process. Lett.16(2009) 913\u2013917."},{"key":"R22","unstructured":"Lee W.-C., Chen S.-k. and Wu C.-C., Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem.Exp. Syst. Appl.37(2010) 6594\u20136601."},{"key":"R23","unstructured":"Leung J.Y.-T., Pinedo M. and Wan G., Competitive two agent scheduling and its applications.Oper. Res.58(2007) 458\u2013469."},{"key":"R24","unstructured":"Peng L., Na Y. and Xiaoye Z., Two-agent single-machine scheduling problems under increasing linear deterioration.Appl. Math. Model.35(2011) 2290\u20132296."},{"key":"R25","unstructured":"Sedeno-Noda A., Alcaide D. and Gonza-Martin C., Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.Eur. J Oper. Res.18(2005) 1501\u20131518."},{"key":"R26","unstructured":"Soltani R., Jolai F. and Zandieh M., Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria.Exp. Syst. Appl.37(2010) 5951\u20135959."},{"key":"R27","unstructured":"A. Soukhal, N. Huynh Tuong and Z. Dao,Parallel machine scheduling with interfering jobs, in 8th International Conference on Multiple Objective and Goal Programming (MOPGP\u201908), Portsmouth, UK (2008)."},{"key":"R28","unstructured":"A. Soukhal, N. Huynh Tuong and Z. Dao, M\u00e9thodes exactes et approch\u00e9es pour l\u2019ordonnancement de travaux interf\u00e9rant (in French), inInt. Symposium on Oper. Res., ISOR\u201908 Algers, Algeria (2008)."},{"key":"R29","unstructured":"V. T\u2019kindt and J.-C. Billaut,Multicriteria scheduling.Second Edition. Springer (2006)."},{"key":"R30","doi-asserted-by":"crossref","unstructured":"Wan G., Leung J.-Y. and Pinedo M., Scheduling two agents with controllable processing times.Eur. J. Oper. Res.205(2007) 528\u2013539.","DOI":"10.1016\/j.ejor.2010.01.005"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"Yuan J., Shang W.-P. and Feng Q., A note on the scheduling which two families of jobs.J. Scheduling8(2005) 537\u2013542.","DOI":"10.1007\/s10951-005-4997-z"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014005\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T06:48:16Z","timestamp":1565246896000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,7]]},"references-count":31,"journal-issue":{"issue":"2"},"alternative-id":["ro140005"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2014005","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,7]]}}}