{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:18:36Z","timestamp":1778563116109,"version":"3.51.4"},"reference-count":10,"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\/2014004","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T15:15:39Z","timestamp":1394205339000},"page":"235-254","source":"Crossref","is-referenced-by-count":11,"title":["A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays"],"prefix":"10.1051","volume":"48","author":[{"given":"Aziz","family":"Moukrim","sequence":"first","affiliation":[]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,3,7]]},"reference":[{"key":"R1","unstructured":"E. Balas and P. Toth, Branch and bound methods, chapter 10, inThe traveling salesman problems: a guided tour of Combinatorial Opt., edited by E.L. Lawler. John Wiley (1985)."},{"key":"R2","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest,Introduction to Algorithms. McGraw-Hill (1990)."},{"key":"R3","unstructured":"S. French, Sequencing and scheduling: an introduction to the mathematics of the job-shop. Series:Math. and its Appl.Ellis Horwood Ltd. (1982)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Gonzalez T. and Sahni S., Flow shop and job shop schedules: complexity and approximations.Oper. Res.26(1978) 36\u201352.","DOI":"10.1287\/opre.26.1.36"},{"key":"R5","unstructured":"Johnson S., Optimal two- and three-stage production with set-up times included.Nav. Res. Log. Quart.1(1954) 61\u201368."},{"key":"R6","unstructured":"Munier-Kordon A. and Rebaine D., Polynomial time algorithms for the UET permutation flowshop problem with time delays.Comput. Oper. Res.35(2008) 525\u2013537."},{"key":"R7","unstructured":"Rayward-Smith V.J. and Rebaine D., Analysis of heuristics for the UET two-machine flow shop.Comput. Oper. Res.35(2008) 3298-3310."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Rebaine D., Permutation shop vs. non permutation flow shop with delays.J. Comput. Industrial Engrg.48(2005) 357\u2013362.","DOI":"10.1016\/j.cie.2005.01.019"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Yu W., Hoogeveen H. and Lenstra J.K., Minimizing makespan in a two-machine flow with delays and unit-time operations is NP-hard.J. Schedul.7(2004) 333\u2013348.","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"},{"key":"R10","unstructured":"W. Yu,The two-machine flow shop problem and the one-machine total tardiness problem. Ph.D. thesis, Eindhoven University of Technology, The Netherlands (1996)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T06:47:43Z","timestamp":1565246863000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,7]]},"references-count":10,"journal-issue":{"issue":"2"},"alternative-id":["ro140004"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2014004","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]]}}}