{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:51:10Z","timestamp":1648662670676},"reference-count":44,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1051\/ro:2008024","type":"journal-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T14:19:02Z","timestamp":1219155542000},"page":"325-359","source":"Crossref","is-referenced-by-count":0,"title":["Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results"],"prefix":"10.1051","volume":"42","author":[{"given":"Jean","family":"Damay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Quilliot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Sanlaville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,8,20]]},"reference":[{"key":"R1","unstructured":"J.F. Allen, Towards a general theory of action and timeArt. Intel.23(1984) 123\u2013154."},{"key":"R2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127-2","author":"Artigues","year":"2000","journal-title":"EJOR"},{"key":"R3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"Artigues","year":"2003","journal-title":"EJOR"},{"key":"R4","unstructured":"K. R.Baker,Introduction to Sequencing and Scheduling. Wiley, NY (1974)."},{"key":"R5","unstructured":"P. Baptiste,Resource constraints for preemptive and non preemptive scheduling. MSC Thesis, University Paris VI (1995)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s00291-003-0155-1","volume":"26","author":"Baptiste","year":"2004","journal-title":"OR Spectrum"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"S. Benzer, On the topology of the genetic fine structureProc. Acad. Sci. USA45(1959) 1607\u20131620.","DOI":"10.1073\/pnas.45.11.1607"},{"key":"R8","unstructured":"C. Berge,Graphes et Hypergraphes. Dunod Ed., Paris (1975)."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"J. Blazewiecz, K.H. Ecker, G. Schmlidt and J. Weglarcz,Scheduling in computer and manufacturing systems.2th edn, Springer-Verlag, Berlin (1993).","DOI":"10.1007\/978-3-662-00074-8_8"},{"key":"R10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comp. Sci."},{"key":"R11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"Brucker","year":"2000","journal-title":"EJOR"},{"key":"R12","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"Brucker","year":"1998","journal-title":"EJOR"},{"key":"R13","unstructured":"J. Carlier and P. Chretienne,Probl\u00e8mes d'ordonnancements:mod\u00e9lisation, complexit\u00e9 et algorithmes. Masson Ed., Paris (1988)."},{"key":"R14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"Carter","year":"1986","journal-title":"Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","volume":"9","author":"Chein","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","volume":"43","author":"Demeulemeester","year":"1997","journal-title":"Manage. Sci."},{"key":"R17","unstructured":"J. Damay,Techniques de resolution bas\u00e9es sur la programmation lin\u00e9aire pour l'ordonnancement de projet.Ph.D. Thesis, Universit\u00e9 de Clermont-Ferrand, (2005)."},{"key":"R18","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1016\/j.ejor.2006.09.052","volume":"182","author":"Damay","year":"2007","journal-title":"EJOR"},{"key":"R19","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(98)00234-3","volume":"117","author":"Djellab","year":"1999","journal-title":"EJOR"},{"key":"R20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"Dolev","year":"1984","journal-title":"J. Algor."},{"key":"R21","unstructured":"P. Duchet,Probl\u00e8mes de repr\u00e9sentations et noyaux. Th\u00e8se d'Etat Paris VI (1981)."},{"key":"R22","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"Dushnik","year":"1941","journal-title":"Amer. J. Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pac. J. Math."},{"key":"R24","first-page":"802","volume":"9","author":"Ghosh","year":"1975","journal-title":"Comm. ACM"},{"key":"R25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"Grahamson","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"R26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:ANOR.0000030689.69422.e1","volume":"129","author":"Josefowska","year":"2004","journal-title":"Annals Oper. Res."},{"key":"R27","unstructured":"W. Herroelen, E. Demeulemeester and B. de Reyck, A classification scheme for project scheduling, in Project Scheduling:recent models, algorithms and applications. Kluwer Acad Publ. (1999) 1\u201326."},{"key":"R28","unstructured":"D.G. Kindall, Incidence matrices, interval graphs and seriation in archaeology, Pac. J. Math.28(1969) 565\u2013570."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"R. Kolisch, A. Sprecher and A. Drexel, Characterization and generation of a general class of resource constrained project scheduling problems,Manage. Sci.41, (10), (1995) 1693\u20131703.","DOI":"10.1287\/mnsc.41.10.1693"},{"key":"R30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/0206004","volume":"6","author":"Kou","year":"1992","journal-title":"SIAM J. Comput."},{"key":"R31","unstructured":"E.L. Lawler, K.J. Lenstra, A.H.G. Rinnoy-Kan and D.B. Schmoys, Sequencing and scheduling: algorithms and complexity, in Handbook of Operation Research and Management Sciences, Vol 4:Logistics of Production and Inventory, edited by S.C. Graves, A.H.G. Rinnoy-Kan and P.H. Zipkin, North-Holland, (1993) 445\u2013522."},{"key":"R32","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(76)90066-1","volume":"5","author":"Luccio","year":"1976","journal-title":"Inform. Processing Lett."},{"key":"R33","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Manage. Sci."},{"key":"R34","first-page":"423","volume":"48","author":"Mohring","year":"1984","journal-title":"Methods Oper. Res."},{"key":"R35","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.orl.2004.06.002","volume":"33","author":"Moukrim","year":"2005","journal-title":"Oper. Res. Lett."},{"key":"R36","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1006025717772","volume":"14","author":"Moukrim","year":"1997","journal-title":"Order"},{"key":"R37","first-page":"324","volume":"17","author":"Muntz","year":"1970","journal-title":"J.A.C.M."},{"key":"R38","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput."},{"key":"R39","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","volume":"30","author":"Patterson","year":"1984","journal-title":"Manage. Sci."},{"key":"R40","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0166-218X(94)90105-8","volume":"51","author":"Quilliot","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"R41","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00337697","volume":"4","author":"Sauer","year":"1987","journal-title":"Order"},{"key":"R42","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00353653","volume":"5","author":"Sauer","year":"1989","journal-title":"Order"},{"key":"R43","unstructured":"A. Schrijver,Theory of Linear and Integer Programming. Wiley, NY (1986)."},{"key":"R44","unstructured":"P. Van Hentenryk,Constraint Programming. North Holland (1997)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008024\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:32:48Z","timestamp":1557750768000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":44,"journal-issue":{"issue":"3"},"alternative-id":["ro0774"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008024","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}