{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:28:59Z","timestamp":1778552939664,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00827-5","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T01:10:51Z","timestamp":1045012251000},"page":"296-306","source":"Crossref","is-referenced-by-count":70,"title":["Genetic algorithms to minimize the weighted number of late jobs on a single machine"],"prefix":"10.1016","volume":"151","author":[{"given":"Marc","family":"Sevaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Dauz\u00e8re-P\u00e9r\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00827-5_BIB1","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB2","doi-asserted-by":"crossref","unstructured":"P. Baptiste, C. Le Pape, L. P\u00e9ridy, Global constraints for partial CSPs: A case study of resource and due-date constraints, 4th International Conference on Principles and Practices of Constraint Programming, Pisa, Italy, 1998","DOI":"10.1007\/3-540-49481-2_8"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB3","unstructured":"P. Baptiste, A. Jouglet, C. Le Pape, W. Nuijten, A constraint-based approach to minimize the weighted number of late jobs on parallel machines. Research report 2000\/228, UMR, CNRS 6599, Heudiasyc, France, 2000"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB4","unstructured":"J. Carlier, Probl\u00e8mes d\u2019ordonnancement \u00e0 contraintes de resources: Algorithmes et complexit\u00e9s, Th\u00e8se d\u2019Etat, Universit\u00e9 de Paris 6, 28 mai 1984"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","article-title":"Minimizing late jobs in the general one machine scheduling problem","volume":"81","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB6","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, An exact method to minimize the number of tardy jobs in single machine scheduling, Research report 99\/6\/AUTO, Ecole des Mines de Nantes, France, 1999"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB7","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, Using Lagrangean relaxation to minimize the (weighted) number of late jobs on a single machine, Research report 99\/8\/AUTO, Ecole des Mines de Nantes, France, 1999"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB8","series-title":"Handbook of Genetic Algorithms","year":"1991"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB9","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job\u2013Shop","author":"French","year":"1990"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB11","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"issue":"1","key":"10.1016\/S0377-2217(02)00827-5_BIB12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.26.1.121","article-title":"A solvable case of the one-machine scheduling problem with ready and due times","volume":"26","author":"Kise","year":"1978","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00827-5_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","article-title":"Knapsack-like scheduling problems, the Moore\u2013Hodgson algorithm and the \u2018tower of sets\u2019 property","volume":"20","author":"Lawler","year":"1994","journal-title":"Mathematical Computer Modelling"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00827-5_BIB15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"A n job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB16","unstructured":"L. P\u00e9ridy, E. Pinson, D. Rivreau, Total cost single-machine scheduling problem with arbitrary release dates, Proceedings of the Workshop on Project Management and Scheduling, Osnabr\u00fcck, Germany, April 17\u201319, 2000, pp. 233\u2013235"},{"issue":"7","key":"10.1016\/S0377-2217(02)00827-5_BIB17","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1287\/mnsc.34.7.843","article-title":"Algorithms for scheduling a single machine to minimize the weighted number of late jobs","volume":"34","author":"Potts","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB18","doi-asserted-by":"crossref","unstructured":"M.C. Portmann, Genetic algorithms and scheduling: A state of the art and some propositions, Proceedings of the Workshop on Production Planning and Control, Mons, Belgium, September 9\u201311, 1996, I\u2013XIV","DOI":"10.1002\/9780470611050.ch4"},{"issue":"1","key":"10.1016\/S0377-2217(02)00827-5_BIB19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00827-5_BIB20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","article-title":"Genetic algorithms for the operations researcher","volume":"9","author":"Reeves","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00827-5_BIB21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/05695558308974657","article-title":"Scheduling a single machine to minimize the weighted number of tardy jobs","volume":"15","author":"Villarreal","year":"1983","journal-title":"IIE Transactions"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T15:55:10Z","timestamp":1553788510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0377221702008275"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00827-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}