{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:13:51Z","timestamp":1774368831488,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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,8]]},"DOI":"10.1016\/s0377-2217(02)00438-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:24:07Z","timestamp":1051727047000},"page":"591-603","source":"Crossref","is-referenced-by-count":27,"title":["Using short-term memory to minimize the weighted number of late jobs on a single machine"],"prefix":"10.1016","volume":"148","author":[{"given":"Laurent","family":"P\u00e9ridy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Pinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Rivreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00438-1_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","article-title":"Dynamic programming state-space relaxation for single-machine scheduling","volume":"39","author":"Abdul-Razaq","year":"1988","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/S0377-2217(02)00438-1_BIB2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","article-title":"Time-indexed formulations for machine scheduling problems: Column generation","volume":"12","author":"van den Akker","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB3","unstructured":"Ph. Baptiste, A. Jouglet, C. Le Pape, W. Nuijten, A constrained-based approach to minimize the weighted number of late jobs on parallel machines, Research Report 2000\/288, Universit\u00e9 de Technologie de Compi\u00e8gne, 2000"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB4","doi-asserted-by":"crossref","unstructured":"Ph. Baptiste, C. Le Pape, L. P\u00e9ridy, Global constraints for partials CSPs: A case study of resource and due date constraints, Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 1998, p. 1520","DOI":"10.1007\/3-540-49481-2_8"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB5","doi-asserted-by":"crossref","unstructured":"Ph. Baptiste, L. P\u00e9ridy, \u00c9. Pinson, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, European Journal of Operations Research, in press","DOI":"10.1016\/S0377-2217(01)00353-8"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB9","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, An exact method to minimize the number of late jobs in single machine scheduling, Technical Report 98\/5 and 99\/6\/auto, \u00c9cole des Mines de Nantes, France, 1998"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB10","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, Genetic algorithms to minimize the weighted number of late jobs on a single machine, European Journal of Operational Research, in press"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(02)00438-1_BIB13","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"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB14","first-page":"27","article-title":"Sequencing to minimize the weighted number of tardy jobs","volume":"10","author":"Lawler","year":"1976","journal-title":"RAIRO Operations Research"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","article-title":"A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the weighted number of late jobs","volume":"26","author":"Lawler","year":"1990","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00438-1_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","article-title":"Knapsack-like scheduling problems, the Moore\u2013Hogdson algorithm and the \u2018tower of sets\u2019 property","volume":"20","author":"Lawler","year":"1994","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB17","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)00438-1_BIB18","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"issue":"7","key":"10.1016\/S0377-2217(02)00438-1_BIB19","doi-asserted-by":"crossref","first-page":"843","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)00438-1_BIB20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","article-title":"The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB21","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB22","unstructured":"J.P. Sousa, Time Indexed Formulation of Non-Preemptive Single-Machine Scheduling Problems, Ph.D. Thesis, Universit\u00e9 Catholique de Louvain, Belgium, 1989"},{"key":"10.1016\/S0377-2217(02)00438-1_BIB23","first-page":"337","article-title":"Scheduling a single machine to minimize the weighted number of tardy jobs","volume":"15","author":"Villarreal","year":"1983","journal-title":"AIIE Transactions"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T01:11:44Z","timestamp":1583975504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0377221702004381"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00438-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}