{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T05:48:50Z","timestamp":1774936130549,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T00:00:00Z","timestamp":1291248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00291-010-0233-0","type":"journal-article","created":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T02:16:15Z","timestamp":1291169775000},"page":"635-663","source":"Crossref","is-referenced-by-count":52,"title":["Project scheduling with flexible resources: formulation and inequalities"],"prefix":"10.1007","volume":"34","author":[{"given":"Isabel","family":"Correia","sequence":"first","affiliation":[]},{"given":"L\u00eddia Lampreia","family":"Louren\u00e7o","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Saldanha-da-Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,2]]},"reference":[{"key":"233_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 JM (1993) The project scheduling polyhedron: dimension, facets and lifting theorems. Eur J Oper Res 67: 204\u2013220","journal-title":"Eur J Oper Res"},{"key":"233_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10732-006-5224-6","volume":"12","author":"R Alvarez-Valdes","year":"2006","unstructured":"Alvarez-Valdes R, Crespo E, Tamarit JM, Villa F (2006) A scatter search algorithm for project scheduling under partially renewable resources. J Heuristics 12: 95\u2013113","journal-title":"J Heuristics"},{"key":"233_CR3","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.ejor.2006.06.073","volume":"189","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes R, Crespo E, Tamarit JM, Villa F (2008) Grasp and path relinking for project scheduling under partially renewable resources. Eur J Oper Res 189: 1153\u20131170","journal-title":"Eur J Oper Res"},{"key":"233_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of job-shop scheduling. ORSA J Comput 3: 149\u2013156","journal-title":"ORSA J Comput"},{"key":"233_CR5","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 Spectr 26: 251\u2013262","journal-title":"OR Spectr"},{"key":"233_CR6","doi-asserted-by":"crossref","unstructured":"Bellenguez O, N\u00e9ron E (2005) Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. In: Practice and theory of automated timetabling V: 5th international conference PATAT 2004, Pittsburgh, PA, USA, 18-20 Aug 2004, Revised selected papers, pp 229\u2013243. Lecture Notes in Computer Science, vol 3616\/2005. Springer, Berlin","DOI":"10.1007\/11593577_14"},{"key":"233_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10288-007-0038-4","volume":"6","author":"O Bellenguez-Morineau","year":"2008","unstructured":"Bellenguez-Morineau O (2008) Methods to solve multi-skill project scheduling problem. 4OR 6: 85\u201388","journal-title":"4OR"},{"key":"233_CR8","unstructured":"Bellenguez-Morineau O, N\u00e9ron E (2006) Genetic algorithms for the multi-skill project scheduling problem. In: Extended abstracts of the 10th international workshop on project management and scheduling, Poland, 26\u201328 Apr 2006"},{"key":"233_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1051\/ro:2007015","volume":"41","author":"O Bellenguez-Morineau","year":"2007","unstructured":"Bellenguez-Morineau O, N\u00e9ron E (2007) A branch-and-bound method for solving multi-skill project scheduling problem. RAIRO Oper Res 41: 155\u2013170","journal-title":"RAIRO Oper Res"},{"key":"233_CR10","unstructured":"Bellenguez-Morineau O, N\u00e9ron E, Heurtebise M (2006) Decomposition method for solving multi-skill project scheduling problem. In: Extended abstracts of the 10th international workshop on project management and scheduling, Poland, 26\u201328 Apr 2006"},{"key":"233_CR11","unstructured":"Bertsegas D, Tseng P (1994) RELAX-IV: a faster version of the relax code for solving minimum cost flow problem. http:\/\/web.mit.edu\/dimitrib\/www\/noc.htm"},{"key":"233_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Rinnooy Kan A (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5: 11\u201324","journal-title":"Discrete Appl Math"},{"key":"233_CR13","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/mnsc.45.4.543","volume":"45","author":"J B\u00f6ttcher","year":"1999","unstructured":"B\u00f6ttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Manage Sci 45: 543\u2013559","journal-title":"Manage Sci"},{"key":"233_CR14","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P Brucker","year":"1998","unstructured":"Brucker P, Knust S, Schoo A, Thiele O (1998) A branch and bound algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 107: 272\u2013288","journal-title":"Eur J Oper Res"},{"key":"233_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker P, Drexl A, M\u00f6hring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models and methods. Eur J Oper Res 112: 3\u201341","journal-title":"Eur J Oper Res"},{"key":"233_CR16","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. Eur J Oper Res 149: 314\u2013324","journal-title":"Eur J Oper Res"},{"key":"233_CR17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1989","unstructured":"Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Manage Sci 35: 164\u2013176","journal-title":"Manage Sci"},{"key":"233_CR18","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-Vald\u00e9s R, Tamarit JM (1987) Project scheduling with resource constraints: a branch and bound approach. Eur J Oper Res 29: 262\u2013273","journal-title":"Eur J Oper Res"},{"key":"233_CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Roux W, Lasserre JB (1998) Multi-resource shop scheduling with resource flexibility. Eur J Oper Res 107: 289\u2013305","journal-title":"Eur J Oper Res"},{"key":"233_CR20","doi-asserted-by":"crossref","unstructured":"Demassey S (2008) Mathematical programming formulations and lower bounds. In: Artigues C, Demassey S, N\u00e9ron E (eds) Resource-constrained project scheduling\u2014models, algorithms, exptensions and applications, pp 49\u201362. ISTE, Willey","DOI":"10.1002\/9780470611227.ch3"},{"key":"233_CR21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s001860000091","volume":"52","author":"U Dorndorf","year":"2000","unstructured":"Dorndorf U, Pesch E, Phan-Huy T (2000) A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math Methods Oper Res 52: 413\u2013439","journal-title":"Math Methods Oper Res"},{"key":"233_CR22","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.ejor.2004.07.014","volume":"167","author":"T Hanne","year":"2005","unstructured":"Hanne T, Nickel S (2005) A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects. Eur J Oper Res 167: 663\u2013678","journal-title":"Eur J Oper Res"},{"key":"233_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207: 1\u201314","journal-title":"Eur J Oper Res"},{"key":"233_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00291-009-0169-4","volume":"32","author":"C Heimerl","year":"2010","unstructured":"Heimerl C, Kolisch R (2010) Scheduling and staffing multiple projects with a multiskilled workforce. OR Spectr 32: 343\u2013368","journal-title":"OR Spectr"},{"key":"233_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W Herroelen","year":"2005","unstructured":"Herroelen W, Leus R (2005) Project scheduling under uncertainty: survey and research potentials. Eur J Oper Res 165: 289\u2013306","journal-title":"Eur J Oper Res"},{"key":"233_CR26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"W Herroelen","year":"1998","unstructured":"Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25: 279\u2013302","journal-title":"Comput Oper Res"},{"key":"233_CR27","unstructured":"ILOG CPLEX user\u2019s manual (2007) ILOG, Inc., Incline Village, Nevada. http:\/\/cplex.ilog.com"},{"key":"233_CR28","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 problem. Eur J Oper Res 112: 322\u2013346","journal-title":"Eur J Oper Res"},{"key":"233_CR29","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90: 320\u2013333","journal-title":"Eur J Oper Res"},{"key":"233_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4615-5533-9_7","volume-title":"Project scheduling: recent models, algorithms and applications","author":"R Kolisch","year":"1999","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer, Dordrecht, pp 147\u2013178"},{"key":"233_CR31","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R Kolisch","year":"2001","unstructured":"Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29: 249\u2013272","journal-title":"Omega"},{"key":"233_CR32","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1996","unstructured":"Kolisch R, Sprecher A (1996) PSPLIB\u2014a project scheduling problem library. Eur J Oper Res 96: 205\u2013216","journal-title":"Eur J Oper Res"},{"key":"233_CR33","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R Kolisch","year":"1995","unstructured":"Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource- constrained project-scheduling problems. Manage Sci 41: 1693\u20131703","journal-title":"Manage Sci"},{"key":"233_CR34","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 the resource-constrained project scheduling problem. Comput Oper Res 38: 3\u201313","journal-title":"Comput Oper Res"},{"key":"233_CR35","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s00291-004-0174-6","volume":"26","author":"C Mellentien","year":"2004","unstructured":"Mellentien C, Schwindt C, Trautmann N (2004) Scheduling the factory pick-up of new cars. OR Spectr 26: 579\u2013601","journal-title":"OR Spectr"},{"key":"233_CR36","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. Manage Sci 44: 714\u2013729","journal-title":"Manage Sci"},{"key":"233_CR37","unstructured":"Pessan C, Bellenguez-Morineau O, N\u00e9ron E (2007) Multi-skill project scheduling problem and total productive maintenance. In: Proceedings of MISTA 2007, 3rd multidisciplinary international scheduling conference, Paris, France, 28\u201331 Aug 2007, pp 608\u2013610"},{"key":"233_CR38","volume-title":"Project scheduling with scarce resources: models, methods, and applications","author":"A Schirmer","year":"1999","unstructured":"Schirmer A (1999) Project scheduling with scarce resources: models, methods, and applications. Verlag Dr. Kovac, Hamburg"},{"key":"233_CR39","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","volume":"18","author":"G Zhu","year":"2006","unstructured":"Zhu G, Bard JF, Yu G (2006) A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. INFORMS J Comput 18: 377\u2013390","journal-title":"INFORMS J Comput"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0233-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-010-0233-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0233-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T18:01:51Z","timestamp":1559844111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-010-0233-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,2]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s00291-010-0233-0","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,2]]}}}