{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T08:29:45Z","timestamp":1773476985159,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":[[2000,12]]},"DOI":"10.1016\/s0377-2217(99)00494-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"363-382","source":"Crossref","is-referenced-by-count":21,"title":["A new LP-based lower bound for the cumulative scheduling problem"],"prefix":"10.1016","volume":"127","author":[{"given":"Jacques","family":"Carlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00494-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(99)00494-4_BIB2","doi-asserted-by":"crossref","unstructured":"Ph. Baptiste, C. Le Pape, Constraints propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, in: Lecture Notes in Computer Science 1330, Springer, Berlin, 1997","DOI":"10.1007\/BFb0017454"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB3","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(99)00494-4_BIB4","unstructured":"J. Carlier, Probl\u00e8mes d'Ordonnancement \u00e0 Contraintes de Ressources: Algorithmes et Complexit\u00e9, Th\u00e8se de Doctorat d'Etat, University of Paris VI, 1984"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB5","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","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB6","unstructured":"J. Carlier, E. N\u00e9ron, A new branch and bound method for solving the resource constrained project scheduling problem, in: Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, 1996, pp. 61\u201365"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1018968332237","article-title":"Jackson's Pseudo Preemptive Schedule for the Pm\/ri, qi\/Cmax problem","volume":"83","author":"Carlier","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB8","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for the multiple resource constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB9","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and generation of a general class of resource-constrained project scheduling problems","volume":"41","author":"Kolish","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB10","unstructured":"P. Lopez, Approche \u00e9nerg\u00e9tique pour l'Ordonnancement de T\u00e2ches sous Contraintes de Temps et de Ressources, PhD Thesis, Universit\u00e9 Paul Sabatier, Toulouse, 1995"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB11","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for project scheduling with resource constraints based on new mathematical formulations","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB12","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","article-title":"A comparison of exact approaches for solving the multiple constrained resource project scheduling problem","volume":"30","author":"Patterson","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB13","unstructured":"M. Perregaard, Branch and bound methods for the multi-processor job-shop and flow-shop scheduling problems, M.Sc. Thesis, University of Copenhagen, 1995"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB14","unstructured":"J. Riordan, in: R.E Krieger, Combinatorial Identities, 1979"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB15","doi-asserted-by":"crossref","unstructured":"A. Sprecher, Resource-Constrained Project Scheduling \u2013 Exact Methods for the Multi-Mode Case, Springer, Berlin, 1994","DOI":"10.1007\/978-3-642-48397-4"},{"key":"10.1016\/S0377-2217(99)00494-4_BIB16","unstructured":"A. Vandevelde, Minimizing the makespan in a multiprocessor flow shop, M.Sc. Thesis, Eindhoven University of Technology, 1994"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004944?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004944?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:45:25Z","timestamp":1578548725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0377221799004944"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00494-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}