{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:04:17Z","timestamp":1767625457507},"reference-count":18,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1051\/ro:2001103","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:42:52Z","timestamp":1069231372000},"page":"71-83","source":"Crossref","is-referenced-by-count":4,"title":["Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release\/Due Date Intervals"],"prefix":"10.1051","volume":"35","author":[{"given":"Valery S.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. A.","family":"Yanushkevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/02331939708844360","volume":"42","author":"Gordon","year":"1997","journal-title":"Optimization"},{"key":"R2","unstructured":"V.S. Gordon and V.S. Tanaev, Single machine deterministic scheduling with step functions of penalties, in:Computers in Engineering. Minsk (1971) 3-8 (in Russian)."},{"key":"R3","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":"R4","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, edited by R.E. Miller and J.W. Thatcher,Complexity of Computer Computations. Plenum Press, New York (1972) 85-103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"Kise","year":"1978","journal-title":"Oper. Res."},{"key":"R6","first-page":"27","volume":"10","author":"Lawler","year":"1976","journal-title":"RAIRO Oper. Res."},{"key":"R7","unstructured":"E.L. Lawler,Scheduling a single machine to minimize the number of late jobs. Preprint. Computer Science Division, University of California, Berkeley (1982)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"Lawler","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"Lawler","year":"1994","journal-title":"Math. Comput. Modelling"},{"key":"R10","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,Sequencing and scheduling: Algorithms and complexity, edited by S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, Logistics of Production and Inventory. North-Holland,Handbooks Oper. Res. Management Sci.4(1993) 445-522."},{"key":"R11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"key":"R12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","volume":"4","author":"Lenstra","year":"1982","journal-title":"European J. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.30.1.116","volume":"30","author":"Monma","year":"1980","journal-title":"Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"Moore","year":"1968","journal-title":"Management Sci."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"J.B. Sidney,An extension of Moore's due date algorithm, edited by S.E. Elmaghraby, Symposium on the Theory of Scheduling and its Applications. Springer, Berlin,Lecture Notes in Econom. and Math. Systems86(1973) 393-398.","DOI":"10.1007\/978-3-642-80784-8_26"},{"key":"R17","unstructured":"V.S. Tanaev and V.S. Gordon, On scheduling to minimize the weighted number of late jobs.Vestsi Akad. Navuk Belarus Ser. Fizi.-Mat. Navuk6(1983) 3-9 (in Russian)."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"V.S. Tanaev, V.S. Gordon and Y.M. Shafransky,Scheduling Theory. Single-Stage Systems. Kluwer Academic, Dordrecht (1994).","DOI":"10.1007\/978-94-011-1190-4"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001103\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:48:59Z","timestamp":1585277339000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":18,"journal-issue":{"issue":"1"},"alternative-id":["ro99122"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001103","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}