{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:18:13Z","timestamp":1762352293760},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,2]],"date-time":"2013-11-02T00:00:00Z","timestamp":1383350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10951-013-0354-9","type":"journal-article","created":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T08:27:42Z","timestamp":1383294462000},"page":"237-248","source":"Crossref","is-referenced-by-count":11,"title":["A preemptive bound for the Resource Constrained Project Scheduling Problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Mohamed","family":"Haouari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anis","family":"Kooli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Carlier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,2]]},"reference":[{"key":"354_CR1","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0377-2217(93)90062-R","volume":"67","author":"R Alvarez-Vald\u00e9s","year":"1993","unstructured":"Alvarez-Vald\u00e9s, R., & Tamarit, M. (1993). The project scheduling polyhedron: Dimension, facets and lifting theorems. European Journal of Operational Research, 67, 204\u2013220.","journal-title":"European Journal of Operational Research"},{"key":"354_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470611227","volume-title":"Resource-constrained project scheduling : Models, algorithms, extensions and applications","author":"C Artigues","year":"2008","unstructured":"Artigues, C., Demassey, S., & N\u00e9ron, E. (2008). Resource-constrained project scheduling : Models, algorithms, extensions and applications. New York: Wiley."},{"key":"354_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00291-003-0155-1","volume":"26","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., & Demassey, S. (2004). Tight LP bounds for resource constrained project scheduling. OR Spectrum, 26, 251\u2013262.","journal-title":"OR Spectrum"},{"key":"354_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305\u2013333.","journal-title":"Annals of Operations Research"},{"key":"354_CR5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"P Brucker","year":"2000","unstructured":"Brucker, P., & Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research, 127, 355\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"354_CR6","doi-asserted-by":"crossref","unstructured":"Carlier, J., Clautiaux, F., & Moukrim, A. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers & Operations Research, 34, 2223\u20132250.","DOI":"10.1016\/j.cor.2005.08.012"},{"key":"354_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","volume":"25","author":"J Carlier","year":"1991","unstructured":"Carlier, J., & Latapie, B. (1991). Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e8mes cumulatifs. RAIRO-RO, 25, 311\u2013340.","journal-title":"RAIRO-RO"},{"key":"354_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0377-2217(99)00494-4","volume":"127","author":"J Carlier","year":"2000","unstructured":"Carlier, J., & N\u00e9ron, E. (2000). A new LP-based lower bound for the cumulative scheduling problem. European Journal of Operational Research, 127, 363\u2013382.","journal-title":"European Journal of Operational Research"},{"key":"354_CR9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0377-2217(02)00763-4","volume":"149","author":"J Carlier","year":"2003","unstructured":"Carlier, J., & N\u00e9ron, E. (2003). On linear lower bounds for the resource constrained project scheduling problem. European Journal of Operational Research, 149, 314\u2013324.","journal-title":"European Journal of Operational Research"},{"key":"354_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides, N., Alvarez-Valdes, R., & Tamarit, J. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29, 262\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"354_CR11","volume-title":"Project scheduling: a research handbook","author":"E Demeulemeester","year":"2002","unstructured":"Demeulemeester, E., & Herroelen, W. (2002). Project scheduling: a research handbook (Vol. 49). Boston: Kluwer Academic Publishers."},{"key":"354_CR12","first-page":"7","volume":"5","author":"J Erschler","year":"1991","unstructured":"Erschler, J., Lopez, P., & Thuriot, C. (1991). Raisonnement temporel sous contraintes de ressources et probl\u00e8mes d\u2019ordonnancement. Revue d\u2019Intelligence Artificielle, 5, 7\u201332.","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"354_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-69346-7_20","volume":"1412","author":"S Fekete","year":"1998","unstructured":"Fekete, S., & Schepers, J. (1998). New classes of lower bounds for bin-packing problems. Lecture Notes in Computer Science, 1412, 257\u2013270.","journal-title":"Lecture Notes in Computer Science"},{"key":"354_CR14","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.cor.2011.05.022","volume":"39","author":"M Haouari","year":"2012","unstructured":"Haouari, M., Kooli, A., & N\u00e9ron, E. (2012). Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Computers & Operations Research, 39, 1187\u20131194.","journal-title":"Computers & Operations Research"},{"key":"354_CR15","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R Klein","year":"1999","unstructured":"Klein, R., & Scholl, A. (1999). Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 112, 322\u2013346.","journal-title":"European Journal of Operational Research"},{"key":"354_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A., & Drexl, A. (1997). PSPLIB\u2014a project scheduling library. European Journal of Operational Research, 96, 205\u2013216.","journal-title":"European Journal of Operational Research"},{"key":"354_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O Kon\u00e9","year":"2011","unstructured":"Kon\u00e9, O., Artigues, C., Lopez, P., & Mongeau, M. (2011). Event-based milp models for resource-constrained project scheduling problems. Computers & Operations Research, 38, 3\u201313.","journal-title":"Computers & Operations Research"},{"key":"354_CR18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1051\/ro\/1982160302411","volume":"16","author":"A Lahrichi","year":"1982","unstructured":"Lahrichi, A. (1982). Ordonnancements: La notion de parties obligatoires et son application aux probl\u00e8mes cumulatifs. RAIRO-RO, 16, 241\u2013262.","journal-title":"RAIRO-RO"},{"key":"354_CR19","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science, 44, 714\u2013729.","journal-title":"Management Science"},{"key":"354_CR20","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R., Schulz, A., Stork, F., & Uetz, M. (2003). Solving project scheduling problems by minimum cut computations. Management Science, 49, 330\u2013350.","journal-title":"Management Science"},{"key":"354_CR21","volume-title":"Algorithms and reliable heuristics programs for multiproject scheduling with resource constraints and related parallel scheduling","author":"I Nabeshima","year":"1973","unstructured":"Nabeshima, I. (1973). Algorithms and reliable heuristics programs for multiproject scheduling with resource constraints and related parallel scheduling. Tokyo: University of Electro-Communications."},{"key":"354_CR22","first-page":"424","volume":"8","author":"P \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P. (2001). A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8, 424\u2013436.","journal-title":"Nordic Journal of Computing"},{"key":"354_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120, 197\u2013207.","journal-title":"Discrete Applied Mathematics"},{"key":"354_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A Pritsker","year":"1969","unstructured":"Pritsker, A., Watters, L., & Wolfe, P. (1969). Multi-project scheduling with limited resources: A zero-one programming approach. Management Science, 16, 93\u2013108.","journal-title":"Management Science"},{"key":"354_CR25","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P., & Wallace, M. (2011). Explaining the cumulative propagator. Constraints, 16, 250\u2013282.","journal-title":"Constraints"},{"key":"354_CR26","doi-asserted-by":"crossref","unstructured":"van den Akker, J., Diepen, G., Hoogeveen, J. (2007). A column generation based destructive lower bound for resource constrained project scheduling problems. In Proceedings of CPAIOR (pp. 376\u2013390).","DOI":"10.1007\/978-3-540-72397-4_27"},{"key":"354_CR27","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/978-3-642-21311-3_22","volume":"6697","author":"P Vilim","year":"2011","unstructured":"Vilim, P. (2011). Timetable edge finding filtering algorithm for discrete cumulative resources. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture Notes in Computer Science, 6697, 230\u2013245.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0354-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0354-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T22:01:00Z","timestamp":1564610460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0354-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,2]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0354-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,2]]}}}