{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:52:09Z","timestamp":1743076329508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054421"},{"type":"electronic","value":"9783319054438"}],"license":[{"start":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T00:00:00Z","timestamp":1412726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T00:00:00Z","timestamp":1412726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-05443-8_22","type":"book-chapter","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T20:18:44Z","timestamp":1421180324000},"page":"491-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Multi-Mode Resource-Constrained Project Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Coelho","sequence":"first","affiliation":[]},{"given":"Mario","family":"Vanhoucke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,8]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1057\/palgrave.jors.2601563","volume":"54","author":"J Alcaraz","year":"2003","unstructured":"Alcaraz J, Maroto C, Ruiz R (2003) Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. J Oper Res Soc 54:614\u2013626","journal-title":"J Oper Res Soc"},{"key":"22_CR2","first-page":"191","volume":"2","author":"O Bailleux","year":"2006","unstructured":"Bailleux O, Boufkhad Y, Roussel O (2006) A translation of pseudo-boolean constraints to SAT. J Satisf Bool Model Comput 2:191\u2013200","journal-title":"J Satisf Bool Model Comput"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1080\/00207549308956882","volume":"31","author":"F Boctor","year":"1993","unstructured":"Boctor F (1993) Heuristics for scheduling projects with resource restrictions and several resource-duration modes. Int J Prod Res 31:2547\u20132558","journal-title":"Int J Prod Res"},{"key":"22_CR4","doi-asserted-by":"publisher","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":"22_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCAD.2004.842808","volume":"24","author":"D Chai","year":"2005","unstructured":"Chai D, Kuehlmann A (2005) A fast pseudo-boolean constraint solver. IEEE T Comput Aid D 24:305\u2013317","journal-title":"IEEE T Comput Aid D"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","volume":"213","author":"J Coelho","year":"2011","unstructured":"Coelho J, Vanhoucke M (2011) Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. Eur J Oper Res 213:73\u201382","journal-title":"Eur J Oper Res"},{"key":"22_CR7","first-page":"151","volume-title":"The complexity of theorem-proving procedures","author":"S Cook","year":"1971","unstructured":"Cook S (1971) The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on theory of computing, pp\u00a0151\u2013158"},{"issue":"7","key":"22_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Comm ACM 5(7):394\u2013397","journal-title":"Comm ACM"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/opre.1060.0358","volume":"55","author":"D Debels","year":"2007","unstructured":"Debels D, Vanhoucke M (2007) A decomposition-based genetic algorithm for the resource-constrained project scheduling problems. Oper Res 55:457\u2013469","journal-title":"Oper Res"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D Debels","year":"2006","unstructured":"Debels D, De Reyck B, Leus R, Vanhoucke M (2006) A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169:638\u2013653","journal-title":"Eur J Oper Res"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2009.12.014","volume":"205","author":"S Elloumi","year":"2010","unstructured":"Elloumi S, Fortemps P (2010) A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. Eur J Oper Res 205:31\u201341","journal-title":"Eur J Oper Res"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-5533-9_1","volume-title":"Project scheduling: recent models, algorithms and applications","author":"W Herroelen","year":"1999","unstructured":"Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problems. In: W\u0229glarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer Academic, Dordrecht, pp 1\u201326"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J Hooker","year":"1995","unstructured":"Hooker J, Vinay V (1995) Branching rules for satisfiability. J Autom Reasoning 15:359\u2013383","journal-title":"J Autom Reasoning"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.amc.2007.04.096","volume":"195","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comput 195:299\u2013308","journal-title":"Appl Math Comput"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J J\u00f3zefowska","year":"2001","unstructured":"J\u00f3zefowska J, Mika M, R\u00f3zycki R, Walig\u00f3ra G, W\u0229glarz J (2001) Simulated annealing for multi-mode resource-constrained project scheduling. Ann Oper Res 102:137\u2013155","journal-title":"Ann Oper Res"},{"key":"22_CR16","first-page":"987","volume":"29","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Drexl A (1997) Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans 29:987\u2013999","journal-title":"IIE Trans"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23\u201337","journal-title":"Eur J Oper Res"},{"key":"22_CR18","doi-asserted-by":"publisher","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: A project scheduling problem library. Eur J Oper Res 96:205\u2013216","journal-title":"Eur J Oper Res"},{"key":"22_CR19","doi-asserted-by":"publisher","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. Manag Sci 41:1693\u20131703","journal-title":"Manag Sci"},{"key":"22_CR20","first-page":"61","volume":"2","author":"O Kullmann","year":"2006","unstructured":"Kullmann O (2006) The SAT 2005 solver competition on random instances. J Satisf Bool Model Comput 2:61\u2013102","journal-title":"J Satisf Bool Model Comput"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"K Li","year":"1992","unstructured":"Li K, Willis R (1992) An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 56:370\u2013379","journal-title":"Eur J Oper Res"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ijpe.2008.11.002","volume":"117","author":"A Lova","year":"2009","unstructured":"Lova A, Tormos P, Cervantes M, Barber F (2009) An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int J Prod Econ 117:302\u2013316","journal-title":"Int J Prod Econ"},{"key":"22_CR23","unstructured":"Markov I, Sakallah K, Ramani A, Aloul F (2002) Generic ILP versus specialized 0\u20131 ILP: an update. In: Proceedings of the international conference on computer-aided design (ICCAD \u201902), pp\u00a0450\u2013457"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J Marques-Silva","year":"1999","unstructured":"Marques-Silva J, Sakallah K (1999) GRASP: a search algorithm for propositional satisfiability. IEEE T Comput 48:506\u2013521","journal-title":"IEEE T Comput"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2007.10.042","volume":"193","author":"M Ranjbar","year":"2009","unstructured":"Ranjbar M, De Reyck B, Kianfar F (2009) A hybrid scatter-search for the discrete time\/resource trade-off problem in project scheduling. Eur J Oper Res 193:35\u201348","journal-title":"Eur J Oper Res"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"F Talbot","year":"1982","unstructured":"Talbot F (1982) Resource-constrained project scheduling problem with time-resource trade-offs: the nonpreemptive case. Manag Sci 28:1197\u20131210","journal-title":"Manag Sci"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0377-2217(02)00768-3","volume":"149","author":"V Valls","year":"2003","unstructured":"Valls V, Quintanilla S, Ballest\u00edn F (2003) Resource-constrained project scheduling: A critical activity reordering heuristic. Eur J Oper Res 149:282\u2013301","journal-title":"Eur J Oper Res"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V Valls","year":"2004","unstructured":"Valls V, Ballest\u00edn F, Quintanilla S (2004) A population based approach to the resource-constrained project scheduling problem. Ann Oper Res 131:305\u2013324","journal-title":"Ann Oper Res"},{"issue":"2","key":"22_CR29","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V Valls","year":"2005","unstructured":"Valls V, Ballest\u00edn F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165(2):375\u2013386","journal-title":"Eur J Oper Res"},{"issue":"2","key":"22_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls V, Ballest\u00edn F, Quintanilla S (2008) A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 185(2):495\u2013508","journal-title":"Eur J Oper Res"},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Van Peteghem","year":"2010","unstructured":"Van Peteghem V, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409\u2013418","journal-title":"Eur J Oper Res"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"4804","DOI":"10.1016\/j.ins.2011.06.014","volume":"181","author":"L Wang","year":"2011","unstructured":"Wang L, Fang C (2011) An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Inform Sci 181:4804\u20134822","journal-title":"Inform Sci"},{"key":"22_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.cor.2011.05.008","volume":"39","author":"L Wang","year":"2012","unstructured":"Wang L, Fang C (2012) An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Comput Oper Res 39:449\u2013460","journal-title":"Comput Oper Res"},{"key":"22_CR34","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J W\u0229glarz","year":"2011","unstructured":"W\u0229glarz J, J\u00f3zefowska J, Mika M, Walig\u00f3ra G (2011) Project scheduling with finite or infinite number of activity processing modes: a survey. Eur J Oper Res 208:177\u2013205","journal-title":"Eur J Oper Res"}],"container-title":["Handbook on Project Management and Scheduling Vol.1"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05443-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T04:53:34Z","timestamp":1674190414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05443-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,8]]},"ISBN":["9783319054421","9783319054438"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05443-8_22","relation":{},"subject":[],"published":{"date-parts":[[2014,10,8]]},"assertion":[{"value":"8 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}