{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:30:41Z","timestamp":1737005441381,"version":"3.33.0"},"reference-count":18,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1051\/ro:20070012","type":"journal-article","created":{"date-parts":[[2007,4,4]],"date-time":"2007-04-04T14:55:41Z","timestamp":1175698541000},"page":"1-18","source":"Crossref","is-referenced-by-count":8,"title":["Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity"],"prefix":"10.1051","volume":"41","author":[{"given":"Mohamed Ali","family":"Aloulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Claude","family":"Portmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,6,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"M.A. Aloulou, On the reactive scheduling design using flexible predictive schedules, inProceedings of IEEE SMC'2002, 6 pages in CD\u2013ROM, Hammamet, October 2002.","key":"R1","DOI":"10.1109\/ICSMC.2002.1175715"},{"key":"R2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000030679.25466.02","volume":"129","author":"Aloulou","year":"2004","journal-title":"Ann. Oper. Res."},{"unstructured":"M.A. Aloulou and M.C. Portmann, An efficient proactive reactive approach to hedge against shop flow disruptions, inMultidisciplinary Scheduling: Thoery and Applications, edited by G. Kendall, E. Burke, S. Petrovic and M. Gendreau, Springer (2005) 223\u2013246.","key":"R3"},{"key":"R4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ejor.2004.04.004","volume":"165","author":"Artigues","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"R5","first-page":"112","volume":"6","author":"Artigues","year":"1999","journal-title":"Inter. J. Industrial Eng. Applications Practice"},{"unstructured":"K.R. Baker,Introduction to sequencing and scheduling. John Wiley and Sons (1974).","key":"R6"},{"doi-asserted-by":"crossref","unstructured":"P. Brucker,Scheduling algorithms. Springer-Verlag (1998).","key":"R7","DOI":"10.1007\/978-3-662-03612-9"},{"unstructured":"P. Brucker and S. Knust, Complexity results for scheduling problems. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/ (2003).","key":"R8"},{"key":"R9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"Daniels","year":"1995","journal-title":"Manage. Sci."},{"unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, edited by W.H. Freeman (1979).","key":"R10"},{"key":"R11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"R12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"Herroelen","year":"2005","journal-title":"Eur. J. Oper. Res."},{"unstructured":"E.L. Lawler,Scheduling a single machine to minimize the number of late jobs. Technical report, Computer Science Division, University of California, Berkeley, USA (1983).","key":"R13"},{"key":"R14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/095119299130443","volume":"12","author":"Mehta","year":"1999","journal-title":"Inter. J. Compu. Integrated Manufacturing"},{"doi-asserted-by":"crossref","unstructured":"M.E. Posner, Reducibility among weighted completion time scheduling problems.Ann. Oper. Res.(1990) 91\u2013101.","key":"R15","DOI":"10.1007\/BF02248586"},{"key":"R16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"doi-asserted-by":"crossref","unstructured":"V.S. Tanaev, V.S. Gordon and Y.M. Shafransky,Scheduling Theory. Single-Stage Systems. Kluwer Academic Publishers (1994).","key":"R17","DOI":"10.1007\/978-94-011-1190-4"},{"key":"R18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.47.1.113","volume":"47","author":"Wu","year":"1999","journal-title":"Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:20070012\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T13:53:20Z","timestamp":1736949200000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:20070012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":18,"journal-issue":{"issue":"1"},"alternative-id":["ro0624"],"URL":"https:\/\/doi.org\/10.1051\/ro:20070012","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}