{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:09:12Z","timestamp":1760710152359},"reference-count":37,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T00:00:00Z","timestamp":1583193600000},"content-version":"vor","delay-in-days":2,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2019,12,13]]},"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:p>This paper deals with the problem of assigning operators to jobs, within a free assignment-changing mode, in a job-shop environment subject to a fixed processing sequence of the jobs. We seek an assignment of operators that minimizes the maximum lateness. Within this model, a job needs an operator during the entire duration of its processing. We show that the problem is \ud835\udca9\ud835\udcab-hard when the number of operators is arbitrary and exhibit polynomial time algorithms for the cases involving one and two operators, respectively.<\/jats:p>","DOI":"10.1051\/ro\/2019116","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T09:18:10Z","timestamp":1583227090000},"page":"555-568","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling job shop problems with operators with respect to the maximum lateness"],"prefix":"10.1051","volume":"54","author":[{"given":"Im\u00e8ne","family":"Benkalai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Baptiste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2020,3,3]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10951-010-0162-4","volume":"14","author":"Agnetis","year":"2010","journal-title":"J. Scheduling"},{"key":"R2","doi-asserted-by":"crossref","first-page":"3820","DOI":"10.1080\/00207543.2013.831220","volume":"52","author":"Agnetis","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1051\/ro\/2016064","volume":"51","author":"Al-Salem","year":"2017","journal-title":"RAIRO: OR"},{"key":"R4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0305-0548(98)00063-X","volume":"26","author":"Aneja","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"Baker","year":"1983","journal-title":"Oper. Res."},{"key":"R6","unstructured":"Baki M.F., Some Problems in One-Operator Scheduling. Ph.D. thesis. University of Waterloo (1999)."},{"key":"R7","unstructured":"Baptiste P. and Munier A., Ordonnancement sur machines parall\u00e8les avec partage d\u2019op\u00e9rateurs. In: 10\u00e8me Congr\u00e8s International de G\u00e9nie Industriel-CIGI 2013 (2013)."},{"key":"R8","unstructured":"Baptiste P., Giard V., Hait A. and Soumis F., Gestion de production et ressources humaines. Presses Internationales Polytechnique (2005)."},{"key":"R9","unstructured":"Benkalai I., Baptiste P. and Rebaine D., Ordonnancement d\u2019ateliers de type flow shop avec contrainte d\u2019op\u00e9rateurs. In: 11\u00e8me Congr\u00e8s International de G\u00e9nie Industriel-CIGI 2015 (2015)."},{"key":"R10","unstructured":"Benkalai I., Baptiste P. and Rebaine D., Ordonnancement d\u2019ateliers de type flow shop avec op\u00e9rateurs en mode d\u2019affectation libre. In: 17 \u00e8me conf\u00e9rence ROADEF (2016)."},{"key":"R11","unstructured":"Benkalai I., Baptiste P. and Rebaine D., Ordonnancement d\u2019ateliers de type flow shop avec op\u00e9rateurs en mode d\u2019affectation libre. In: 17\u00e8me Conf\u00e9rence ROADEF de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et Aide \u00e0 la D\u00e9cision (2016)."},{"key":"R12","unstructured":"Benkalai I., Rebaine D. and Baptiste P., Assigning operators in a flow shop environment. In: Information Systems, Logistics and Supply Chain (2016)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1080\/00207543.2018.1425557","volume":"57","author":"Benkalai","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"Bierwirth","year":"1995","journal-title":"Oper. Res. Spectr."},{"key":"R15","unstructured":"Blazewicz J., Ecker K., Pesch E., Schmidt G. and Weglarz J., Handbook on scheduling: From theory to applications. Springer (2007)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/S0305-0548(98)00087-2","volume":"26","author":"Cheng","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"R17","unstructured":"Cheurfa M., Gestion des ressources humaines en production cyclique. Ph.D. thesis. ENSM Saint-\u00c9tienne (2005)."},{"key":"R18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-005-2861-9","volume":"8","author":"Dawande","year":"2005","journal-title":"J. Scheduling"},{"key":"R19","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1080\/07408170801965108","volume":"40","author":"Geismar","year":"2008","journal-title":"IIE Trans."},{"key":"R20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"Giffler","year":"1960","journal-title":"Oper. Res."},{"key":"R21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1051\/ro\/2014028","volume":"49","author":"Grangeon","year":"2015","journal-title":"RAIRO: OR"},{"key":"R22","unstructured":"Lawler E.L., Preemptive scheduling of precedence-constrained jobs on parellel machines. In: Deterministic and Stochastic Scheduling, Proceedings of the NATO Advanced Study and Reasearch Institute on Theoretical Approaches to Scheduling Problems. D. Reidel publishing Co. (1982) 101\u2013123."},{"key":"R23","first-page":"365","volume":"28","author":"Mencia","year":"2015","journal-title":"Artif. Intell. Commun."},{"key":"R24","unstructured":"Mencia R., Sierra M.R., Mencia C. and Varela R., Genetic algorithm for job shop with operatos, edited by Ferrandez J.M., Alvarez Sanchez J.R., de la Paz F. and Toledo F.J.. In: Vol. 6687 of New challenges on bioinspired applications. IWINAC. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (2011)."},{"key":"R25","doi-asserted-by":"crossref","first-page":"5221","DOI":"10.1080\/00207543.2013.802389","volume":"51","author":"Mencia","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"R26","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11047-013-9373-x","volume":"13","author":"Mencia","year":"2014","journal-title":"Nat. Comput."},{"key":"R27","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.asoc.2015.05.004","volume":"34","author":"Mencia","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"R28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1051\/ro\/2014052","volume":"49","author":"Paul","year":"2015","journal-title":"RAIRO: OR"},{"key":"R29","unstructured":"Pinedo M., Scheduling: Theory, Algorithms and Systems. Prentice Hall (2002)."},{"key":"R30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","volume":"4","author":"Sethi","year":"1992","journal-title":"Int. J. Flexible Manuf. Syst."},{"key":"R31","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/18756891.2013.768434","volume":"6","author":"Shivasankaran","year":"2013","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"R32","unstructured":"Sierra M.R., Mencia C. and Varela R., Optimally scheduling a job shop with operators and total flow time, edited by Lozana J.A., Ganaz J.A. and Moreno J.A.. In: Vol. 7027 of Advances in Artificial intelligence. CAEPIA. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2011)."},{"key":"R33","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10845-013-0810-6","volume":"26","author":"Sierra","year":"2015","journal-title":"J. Intell. Manuf."},{"key":"R34","unstructured":"Ullman J.D., Complexity of sequencing problems. In: Computer and Job\/Shop Scheduling Theory. Wiley & Sons, Inc., New York (1976)."},{"key":"R35","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"Vickson","year":"1980","journal-title":"Oper. Res."},{"key":"R36","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"Vickson","year":"1980","journal-title":"AIIE Trans."},{"key":"R37","unstructured":"Zouba M., Ordonnancement de machines parall\u00e8les identiques avec des contraintes de ressources humaines. Ph.D. thesis, \u00c9cole Polytechnique Montr\u00e9al (2009)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019116\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T08:07:49Z","timestamp":1584691669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":37,"journal-issue":{"issue":"2"},"alternative-id":["ro170229"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2019116","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}