{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:05:23Z","timestamp":1762520723721},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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,1]]},"DOI":"10.1016\/s0377-2217(01)00353-8","type":"journal-article","created":{"date-parts":[[2002,10,3]],"date-time":"2002-10-03T20:16:26Z","timestamp":1033676186000},"page":"1-11","source":"Crossref","is-referenced-by-count":44,"title":["A branch and bound to minimize the number of late jobs on a single machine with release time constraints"],"prefix":"10.1016","volume":"144","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Peridy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Pinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00353-8_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0167-6377(98)00045-5","article-title":"An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","volume":"24","author":"Baptiste","year":"1999","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","article-title":"Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal","volume":"2","author":"Baptiste","year":"1999","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB4","article-title":"Constraint-based scheduling: Applying constraint programming to scheduling problems","volume":"vol. 39","author":"Baptiste","year":"2001"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB5","series-title":"Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming","article-title":"Global constraints for partials csps: a case study of resource and due date constraints","author":"Baptiste","year":"1998"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BF02085636","article-title":"The job-shop problem and immediate selection","volume":"50","author":"Brucker","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch and bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(01)00353-8_BIB8","doi-asserted-by":"crossref","DOI":"10.1051\/ro\/1978120403331","article-title":"Ordonnancements \u00e0 machines disjunctives","volume":"12","author":"Carlier","year":"1975","journal-title":"RAIRO"},{"issue":"4","key":"10.1016\/S0377-2217(01)00353-8_BIB9","article-title":"Probl\u00e8me \u00e0 une machine et algorithmes polyn\u00f4miaux","volume":"5","author":"Carlier","year":"1981","journal-title":"Questio"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one machine problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB11","unstructured":"J. Carlier, Probl\u00e8mes d'ordonnancements \u00e0 contraintesde ressources: Algorithmes et complexit\u00e9, Th\u00e8se d'\u00c9tat, Ph.D. Thesis, University of Paris VI, 1984"},{"issue":"2","key":"10.1016\/S0377-2217(01)00353-8_BIB12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of jackson's preemptive schedule for solving the job-shop problem","volume":"26","author":"Carlier","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustments 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(01)00353-8_BIB15","unstructured":"Y. Caseau, F. Laburthe, Disjunctive scheduling with task intervals, Technical Report, LIENS Technical Report 95-25, \u00c9coleNormale Sup\u00e9rieure Paris, France, 1995"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB16","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(01)00353-8_BIB17","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, An branch and bound method to minimize the number of late jobs in single machine, Technical Report 98\/5\/AUTO, Ecole des Mines de Nantes, 1998"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB18","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, A efficient formulation for minimizing the number of late jobs on a single machine, Technical Report 98\/9\/AUTO, Ecole des Mines de Nantes, 1998"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB19","unstructured":"S. Dauz\u00e8re-P\u00e9r\u00e8s, M. Sevaux, An exact method to minimize the number of tardy jobs on a single machine, Technical Report 99\/6\/AUTO, Ecole des Mines de Nantes, SDP, MS, 1999"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB20","unstructured":"G. Dewess, Ein existenzsatz f\u00fcr packungs probleme mit konsequenzen f\u00fcr die berechnung optimaler maschinenbelegungspl\u00e4ne, Technical report, Universit\u00e4t Leipzig, 1991"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(80)90005-3","article-title":"Characterizing the set of feasible sequences for n jobs to be carried out on a single machine","volume":"4","author":"Erschler","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB22","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Technical Report 43, University of California, Los Angeles, 1955"},{"issue":"1","key":"10.1016\/S0377-2217(01)00353-8_BIB23","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":"26","key":"10.1016\/S0377-2217(01)00353-8_BIB24","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","article-title":"A dynamic programming algorithm for the preemptive scheduling of a single machine to minimize the number of late jobs","author":"Lawler","year":"1990","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(01)00353-8_BIB25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","article-title":"Knapsack-like scheduling problems, the moore-hodgson algorithm and the \u201ctower of sets\u201d property","volume":"20","author":"Lawler","year":"1994","journal-title":"Mathematical Computer Modelling"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB26","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"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB27","unstructured":"P. Lopez, Approche \u00e9nerg\u00e9tique pour l'ordonnancement de t\u00e2ches sous contraintes de temps et de ressources, Ph.D. Thesis, Universit\u00e9 Paul Sabatier, 1991"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB28","doi-asserted-by":"crossref","unstructured":"P. Martin, D.B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, in: Proceedings of the fifth Conference on Integer Programming and Combinatorial Optimization, 1996","DOI":"10.1007\/3-540-61310-2_29"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB29","series-title":"Mathematical Programming","author":"Minoux","year":"1986"},{"issue":"1","key":"10.1016\/S0377-2217(01)00353-8_BIB30","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"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB31","unstructured":"L. Peridy, Le probl\u00e8me de Job-Shop: arbitrages et ajustements, Ph.D. Thesis, University of Technology of Compi\u00e8gne, 1996"},{"key":"10.1016\/S0377-2217(01)00353-8_BIB32","unstructured":"D. Rivreau, Probl\u00e8mes d'ordonnancement disjonctifs: r\u00e8gles d'\u00e9limination et bornes inf\u00e9rieures, Ph.D. Thesis, University of Technology of Compi\u00e8gne, 1999"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T16:52:29Z","timestamp":1578502349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0377221701003538"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00353-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}