{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T00:45:33Z","timestamp":1782261933174,"version":"3.54.5"},"reference-count":21,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1051\/ro\/2015015","type":"journal-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T06:45:30Z","timestamp":1434091530000},"page":"223-232","source":"Crossref","is-referenced-by-count":12,"title":["Two machines flow shop with reentrance and exact time lag"],"prefix":"10.1051","volume":"50","author":[{"given":"Karim","family":"Amrouche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mourad","family":"Boudhar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2016,3,21]]},"reference":[{"key":"R1","unstructured":"Ageev A.A. and Barburin A.E., Approximation algorithms for UET scheduling problems with exact delays.Oper. Res. Lett.35(2007) 533\u2013540."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"A.A. Ageev and A.V. Kononov, Approximation Algorithms for Scheduling Problems with Exact Delays. In WAOA, vol. 4368 ofLect. Notes Comput. Sci.(2006) 1\u201314.","DOI":"10.1007\/11970125_1"},{"key":"R3","unstructured":"Ahr D., B\u00e9k\u00e9si J., Galambos G., Oswald M. and Reinelt G., An exact algorithm for scheduling identical coupled tasks.Math. Methods Oper. Res.59(2004) 193\u2013203."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Blazewicz J., Ecker K., Kis T., Potts CN., Tanas M. and Whitehead J., Scheduling of coupled tasks with unit processing times.J. Sched.13(2010) 453\u2013461.","DOI":"10.1007\/s10951-010-0167-z"},{"key":"R5","unstructured":"Boudhar M. and Meziani N., Two-stage hybrid flow shop with recirculation.Int. Trans. Oper. Res.17(2010) 239\u2013255."},{"key":"R6","unstructured":"Brauner N., Finke G., Lehoux-Lebacque V., Potts C. and Whithead J., Scheduling of coupled tasks and one-machine no-wait robotic cells.Comput. Oper. Res.36(2009) 301\u2013307."},{"key":"R7","unstructured":"Dell\u2019Amico M., Shop problems with two machines and time lags.Oper. Res.44(1996) 777\u2013787."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Dhouib E., Teghem J. and Loukir T., Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints.J. Math. Model. Algorithms12(2013) 85\u201399.","DOI":"10.1007\/s10852-012-9180-x"},{"key":"R9","unstructured":"Fondrevelle J., Oulamara A., Portmann M.C., Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times.Int. J. Prod. Econ.33(2007) 168\u2013176."},{"key":"R10","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability. W.H. Freeman and Company, New York (1979)."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Johnson S.M., Optimal two and three-stage production schedules with setup times included.Nav. Res. Logist. Quarterly1(1954) 61\u201368.","DOI":"10.1002\/nav.3800010110"},{"key":"R12","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling theory: algorithms and complexity. InHandb. Oper. Res. Manag. Sci.Edited by S.C. Graves, P.H. Zipkin and A.H.G. Rinnooy Kan. North Holland, Amesterdam (1993)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Lev V. and Adiri I., V-shop scheduling.Eur. J. Oper. Res.18(1984) 51\u201356.","DOI":"10.1016\/0377-2217(84)90260-1"},{"key":"R14","unstructured":"Mitten L.G., Sequencing n jobs on two machines with arbitrary time lags.Manage. Sci.5(1959) 293\u2013298."},{"key":"R15","unstructured":"Orman A.J. and Potts C.N., On the Complexity of Coupled-task Scheduling.Discrete Appl. Math.72(1997) 141\u201354."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Shapiro R.D., Scheduling coupled tasks.Nav. Res. Logist. Quarterly27(1980) 489\u201397.","DOI":"10.1002\/nav.3800270312"},{"key":"R17","unstructured":"Vargas-Villamil F.D. and Rivera D.E., A model predictive control approach for real-time optimization of reentrant manufacturing lines.Comput. Ind.45(2001) 45\u201357."},{"key":"R18","unstructured":"Wang M.Y., Sethi S.P. and Van De Velde S.L., Minimizing makespan in a class of reentrant shops.Oper. Res.45(1997) 702\u2013712."},{"key":"R19","unstructured":"W. Yu, The two-machine flowshop problem with delays and the one-machine total tardiness problem. Ph. D. thesis, Technische Universiteit Eindhoven (1996)."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Yu W., Hoogeveen H. and Lenstra J.K., Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard.J. Sched.7(2004)const3\u2013348.","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Zhang X. and Van de Velde S., On-line two-machine open shop scheduling with time lags.Eur. J. Oper. Res.204(2010) 14\u201319.","DOI":"10.1016\/j.ejor.2009.09.023"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:36:37Z","timestamp":1566848197000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,21]]},"references-count":21,"journal-issue":{"issue":"2"},"alternative-id":["ro150015"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015015","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,21]]}}}