{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T01:55:47Z","timestamp":1762998947516},"reference-count":25,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1051\/ro\/2013025","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T15:10:30Z","timestamp":1360595430000},"page":"33-46","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds"],"prefix":"10.1051","volume":"47","author":[{"given":"Cyril","family":"Briand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samia","family":"Ourari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2013,2,11]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Aissi H., Aloulou M.A. and Kovalyov M.Y., Minimizing the number of late jobs on a single machine under due date uncertainty.J. Sched.14(2011) 351\u2013360.","DOI":"10.1007\/s10951-010-0183-z"},{"key":"R2","unstructured":"Aloulou M.A. and Della-Croce F., Complexity of one machine scheduling problems under scenario-based uncertainty.Oper. Res. Lett.36(2008) 338\u2013342."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Baptiste P., Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal.J. Sched.2(1999) 245\u2013252.","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Baptiste P., Peridy L. and Pinson E., A branch and bound to mininimze the number of late jobs on a single machine with release time constraints.Eur. J. Oper. Res.144(2003) 1\u201311.","DOI":"10.1016\/S0377-2217(01)00353-8"},{"key":"R5","unstructured":"Baptiste P., Della Croce F., Grosso A. and T\u2019kindt V., Sequencing a single machine with due dates and deadlines : an ILP-based approach to solve very large instances.J. Sched.13(2010) 39\u201347."},{"key":"R6","unstructured":"Briand C., Ourari S. and Bouzouia B., An efficient ILP formulation for the single machine scheduling problem.RAIRO Oper. Res.44(2010) 61\u201371."},{"key":"R7","unstructured":"Carlier J., Probl\u00e8mes d\u2019ordonnancements \u00e0 dur\u00e9es \u00e9gales.QUESTIO5(4) (1981) 219\u2013228."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Chrobak M., D\u00fcrr C., Jawor W., Kowalik L. and Kurowski M., A Note on scheduling equal-length jobs to maximize throughput.J. Sched.9(2006) 71\u201373.","DOI":"10.1007\/s10951-006-5595-4"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S. and Sevaux M., An exact method to minimize the number of tardy jobs in single machine scheduling.J. Sched.7(2004) 405\u2013420.","DOI":"10.1023\/B:JOSH.0000046073.05827.15"},{"key":"R10","unstructured":"Erenay F.S., Sabuncuoglu I., Toptal A. and Tiwari M.K., New solution methods for single machine bicriteria scheduling problem : Minimization of average flowtime and number of tardy jobs.Eur. J. Oper. Res.201(2010) 89\u201398."},{"key":"R11","unstructured":"Erschler J., Fontan G., Merce C. and Roubellat F., A new dominance concept in schedulingnjobs on a single machine with ready times and due dates.Oper. Res.31(1983) 114\u2013127."},{"key":"R12","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company (1979)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Guohua W. and Benjamin P.-C.Y., Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs.Eur. J. Oper. Res.195(2009) 89\u201397.","DOI":"10.1016\/j.ejor.2008.01.029"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems. in Complexity of Computer Computations, edited by R.E. Miller and J.W. Thatcher. Plenum Press, New York (1972) 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R15","unstructured":"Kise H., Toshihide I. and Mine H., A solvable case of the one-machine scheduling problem with ready and due times.Oper. Res.26(1978) 121\u2013126."},{"key":"R16","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":"R17","unstructured":"Lawler E.L., A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs.Ann. Oper. Res.26(1990) 125\u2013133."},{"key":"R18","unstructured":"Lee J.Y., Kim Y.D., Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance.Comput. Oper. Res.39(2012) 2196\u20132205."},{"key":"R19","unstructured":"Lenstra J.K., Rinnooy Han A.H.G. and Brucker P., Complexity of machine scheduling problems.Ann. Discrete Math.1(1977) 343\u2013362."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"M'Hallah R. and Bulfin R.L., Minimizing the weighted number of tardy jobs on a single machine with release dates.Eur. J. Oper. Res.176(2007) 727\u2013744.","DOI":"10.1016\/j.ejor.2005.08.013"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"M'Hallah R., Bulfin R.L., Minimizing the weighted number of tardy jobs on a single machine.Eur. J. Oper. Res.145(2003) 45\u201356.","DOI":"10.1016\/S0377-2217(02)00180-7"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Moore M.J., An n job, one machine sequencing algorithm for minimizing the number of late jobs.Manag. Sci.15(1) (1968) 102\u2013109.","DOI":"10.1287\/mnsc.15.1.102"},{"key":"R23","unstructured":"S. Ourari and C. Briand Conditions de dominance pour le probl\u00e8me \u00e0 une machine avec minimisation des travaux en retard\u201d 9\u00e8me Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision (ROADEF\u201908), Clermont-Ferrand (France) 351\u2013352 (2008)."},{"key":"R24","unstructured":"Tuong N.H., Soukhal A. and Billaut J.-C., Single-machine multi-agent scheduling problems with a global objective function.J. Sched.15(2011) 311\u2013321."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Yedidsion L., Shabtay D., Korach E. and Kaspi M., A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine.Int. J. Product. Econom.119(2009) 298\u2013307.","DOI":"10.1016\/j.ijpe.2009.03.003"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013025\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T15:43:20Z","timestamp":1562687000000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":25,"journal-issue":{"issue":"1"},"alternative-id":["ro130025"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2013025","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}