{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:55:24Z","timestamp":1774644924073,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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,9]]},"DOI":"10.1016\/s0377-2217(02)00763-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"314-324","source":"Crossref","is-referenced-by-count":41,"title":["On linear lower bounds for the resource constrained project scheduling problem"],"prefix":"10.1016","volume":"149","author":[{"given":"J.","family":"Carlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00763-4_BIB1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","article-title":"Satisfiability tests and time-bound adjustments for cumulative scheduling problems","volume":"92","author":"Baptiste","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","article-title":"Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problem","volume":"5","author":"Baptiste","year":"2000","journal-title":"Constraints"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB3","unstructured":"J. Blazewicz, W. Cellary, R. Slowinsky, Scheduling under resource constraints\u2013\u2013deterministic models, Annals of Operations Research 7, JC Baltzer AG, 1986"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: Classification and complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","article-title":"A linear programming and constraint propagation-based lower bound for the RCPSP","volume":"127","author":"Brucker","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00763-4_BIB6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch and bound algorithm for the resource-constrained project scheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB7","unstructured":"J. Carlier, Probl\u00e8mes d\u2019Ordonnancement \u00e0 Contraintes de Ressources: Algorithmes et Complexit\u00e9, Th\u00e8se d\u2019Etat, Universit\u00e9 Pierre et Marie Curie, 1984"},{"issue":"3","key":"10.1016\/S0377-2217(02)00763-4_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","article-title":"Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e8mes cumulatifs","volume":"25","author":"Carlier","year":"1991","journal-title":"RAIRO-RO"},{"issue":"2","key":"10.1016\/S0377-2217(02)00763-4_BIB9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0377-2217(99)00494-4","article-title":"A new LP bound for the cumulative scheduling problem","volume":"127","author":"Carlier","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB10","unstructured":"Y. Caseau, F. Laburthe, CLAIRE: A parametric tool to generate C++ code for problem solving, Working paper, Bouygues, Direction Scientifique, 1996"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: A branch-and-bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB12","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","article-title":"New benchmark results for the resource-constrained project scheduling problem","volume":"43","author":"Demeulemeester","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0377-2217(95)00358-4","article-title":"An efficient solution procedure for the preemptive resource-constrained project scheduling problem","volume":"90","author":"Demeulemeester","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB14","first-page":"257","article-title":"New classes of lower bounds for bin packing problems","volume":"vol. 1412","author":"Fekete","year":"1998"},{"issue":"part 1","key":"10.1016\/S0377-2217(02)00763-4_BIB15","article-title":"Optimal solutions of scheduling problems using Lagrangean multipliers","volume":"21","author":"Fischer","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB16","unstructured":"R. Heilman, C. Schwindt, Lower Bounds for RCPSP\/max, Report WIOR-511, University of Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB17","doi-asserted-by":"crossref","unstructured":"K. Jansen, L. Porkolab, Preemptive Parallel Task Scheduling in O(n)+poly(m) Time, ISAAC 2000, Taipeh","DOI":"10.1007\/3-540-40996-3_34"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB19","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvements: An application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB20","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSBLIB\u2013\u2013A project scheduling problem library","volume":"96","author":"Kolisch","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB21","first-page":"241","article-title":"Ordonnancements: La notion de \u201cparties obligatoires\u201d et son application aux probl\u00ebmes cumulatifs","volume":"16","author":"Lahrichi","year":"1982","journal-title":"R.A.I.R.O.- Recherche Op\u00e9rationnelle"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB22","unstructured":"C. Le Pape, Ph. Baptiste, A constraint programming library for preemptive and non-preemptive scheduling problem, in: Proceedings of the Third International Conference and Exhibition on the Practical Application of Constraint Technology, London, 1997"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB23","first-page":"453","article-title":"Ordonnancement de t\u00e2ches sous contraintes: Une approche energ\u00e9tique","volume":"26","author":"Lopez","year":"1992","journal-title":"RAIRO-APII"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","article-title":"Lower bounds and reduction procedures for the bin-packing problem","volume":"28","author":"Martello","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB25","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation","volume":"44\u201345","author":"Mingozzi","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB26","first-page":"139","article-title":"Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems","volume":"vol. 1643","author":"Mohring","year":"1999"},{"key":"10.1016\/S0377-2217(02)00763-4_BIB27","unstructured":"E. N\u00e9ron, J. Carlier, Extension of the multiple elastic and preemptive lower bound: B=11 and B=12, in: Proceedings of the 7th Workshop on Project Management and Scheduling, Osnabrueck, 2000, pp. 99\u2013103"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007634?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007634?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:59:29Z","timestamp":1583996369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007634"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00763-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}