{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:22:20Z","timestamp":1743009740217,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":48,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781461490555"},{"type":"electronic","value":"9781461490562"}],"license":[{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"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":[[2014]]},"DOI":"10.1007\/978-1-4614-9056-2_11","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T16:56:54Z","timestamp":1386003414000},"page":"249-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multimode Resource-Constrained Project Scheduling Problem Including Multiskill Labor (MRCPSP-MS) Model and a Solution Method"],"prefix":"10.1007","author":[{"given":"M\u00f3nica A.","family":"Santos","sequence":"first","affiliation":[]},{"given":"Anabela P.","family":"Tereso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,3]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1504\/IJMOR.2010.035497","volume":"2","author":"M. Arroub","year":"2010","unstructured":"Arroub, M., Kadrou, Y., & Najid, N. (2010). An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility. International Journal of Mathematics in Operational Research, 2(6), 748\u2013761.","journal-title":"International Journal of Mathematics in Operational Research"},{"issue":"2","key":"11_CR2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0377-2217(94)90380-8","volume":"78","author":"M. Bandelloni","year":"1994","unstructured":"Bandelloni, M., Tucci, M., & Rinaldi, R. (1994). Optimal resource leveling using non-serial dynamic programming. European Journal of Operational Research, 78(2), 162\u2013177.","journal-title":"European Journal of Operational Research"},{"key":"11_CR3","unstructured":"Basnet, C., Tang, G., & Yamaguchi, T. (2001). A beam search heuristic for multi-mode single resource constrained project scheduling. In proceedings of 36th Annual Conference of the Operational Research Society of New Zealand, Christchurch, NZ, Nov-Dec, 1\u20138"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2307\/2002797","volume":"13","author":"R. Bellman","year":"1959","unstructured":"Bellman, R., & Dreyfus, S. (1959). Functional approximations and dynamic programming. Mathematical Tables and Other Aids to Computation, 13, 247\u2013251.","journal-title":"Mathematical Tables and Other Aids to Computation"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M. E., M\u00f6hring, R. H., & Schulz, J. (2010). A constraint integer programming approach for resource-constrained project scheduling. In proceedings of CPAIOR 2010, LNCS, June, Andrea Lodi, Michela Milano, Paolo Toth (Eds.), Springer, 6140, pp.\u00a051\u201355.","DOI":"10.1007\/978-3-642-13520-0_34"},{"issue":"1","key":"11_CR6","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, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5(1), 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","volume":"49","author":"F. F. Boctor","year":"1990","unstructured":"Boctor, F. F. (1990). Some efficient multi-heuristic procedures for resource constrained project scheduling. European Journal of Operational Research, 49, 3\u201313.","journal-title":"European Journal of Operational Research"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1080\/00207549308956882","volume":"31","author":"F. F. Boctor","year":"1993","unstructured":"Boctor, F. F. (1993). Heuristics for scheduling projects with resource restrictions and several resource-duration modes. International Journal of Production Research, 31, 2547\u20132558.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1287\/opre.10.3.405","volume":"10","author":"C. E. Clark","year":"1962","unstructured":"Clark, C. E. (1962). The PERT model for the distribution of an activity time. Operations Research, 10(3), 405\u2013406.","journal-title":"Operations Research"},{"issue":"4","key":"11_CR10","first-page":"177","volume":"17","author":"E. W. Davis","year":"1966","unstructured":"Davis, E. W. (1966). Resource allocation in project network models\u2014A survey. Journal of Industrial Engineering, 17(4), 177\u2013188.","journal-title":"Journal of Industrial Engineering"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/17.119663","volume":"39","author":"B. V. Dean","year":"1992","unstructured":"Dean, B. V., Denzler, D. R., & Watkins, J. J. (1992). Multiproject staff scheduling with variable resource constraints. IEEE Transactions on Engineering Management, 39, 59\u201372.","journal-title":"IEEE Transactions on Engineering Management"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0377-2217(95)00358-4","volume":"90","author":"E. L. Demeulemeester","year":"1996","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (1996). An efficient optimal solution procedure for the preemptive resource-constrained scheduling problem. European Journal of Operational Research, 90, 334\u2013348.","journal-title":"European Journal of Operational Research"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/mnsc.31.2.207","volume":"31","author":"B. M. Dodin","year":"1985","unstructured":"Dodin, B. M., & Elmaghraby, S. E. (1985). Approximating the criticality indices in the activities in PERT networks. Management Science, 31, 207\u2013223.","journal-title":"Management Science"},{"key":"11_CR14","first-page":"50","volume":"88","author":"S. E. Elmaghraby","year":"1992","unstructured":"Elmaghraby, S. E. (1992). Resource allocation via dynamic programming in activity networks. European Journal of Operational Research, 88, 50\u201386.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"11_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0377-2217(80)90053-3","volume":"5","author":"S. E. Elmaghraby","year":"1980","unstructured":"Elmaghraby, S. E., & Herroelen, W. S. (1980). On the measurement of complexity in activity networks. European Journal of Operational Research, 5(4), 223\u2013234.","journal-title":"European Journal of Operational Research"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0377-2217(90)90118-U","volume":"49","author":"S. E. Elmaghraby","year":"1990","unstructured":"Elmaghraby, S. E., & Herroelen, W. S. (1990). The scheduling of activities to maximize the net present value of projects. European Journal of Operational Research, 49, 35\u201340.","journal-title":"European Journal of Operational Research"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0377-2217(95)00382-7","volume":"96","author":"R. Etgar","year":"1997","unstructured":"Etgar, R., Shtub, A., & LeBlanc, L. J. (1997). Scheduling projects to maximize net present value\u2014The case of time-dependent, contingent cash flows. European Journal of Operational Research, 96, 90\u201396.","journal-title":"European Journal of Operational Research"},{"key":"11_CR18","unstructured":"Gon\u00e7alves, J. F., Mendes, J. J. M., & Resende, M. G. C. (2004). A genetic algorithm for the resource constrained multi-project scheduling problem. Technical ReportTD-668LM4, AT&T Labs Research"},{"issue":"2","key":"11_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10951-008-0059-7","volume":"11","author":"T. Guldemond","year":"2008","unstructured":"Guldemond, T., Hurink, J., Paulus, J., & Schutten, J. (2008). Time-constrained project scheduling. Journal of Scheduling, 11(2), 137\u2013148.","journal-title":"Journal of Scheduling"},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S. Hartmann","year":"2001","unstructured":"Hartmann, S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operational Research, 102, 111\u2013135.","journal-title":"Annals of Operational Research"},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/PL00013354","volume":"23","author":"R. Heilmann","year":"2000","unstructured":"Heilmann, R. (2000). Resource-constrained project scheduling: A heuristic for the multi-mode case. OR Spektrum, 23, 335\u2013357.","journal-title":"OR Spektrum"},{"issue":"4","key":"11_CR22","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1111\/j.1937-5956.2005.tb00230.x","volume":"14","author":"W. Herroelen","year":"2006","unstructured":"Herroelen, W. (2006). Project scheduling-theory and practice. Production and Operations Management, 14(4), 413\u2013432.","journal-title":"Production and Operations Management"},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"1262","DOI":"10.1057\/jors.1996.153","volume":"47","author":"B. Kazaz","year":"1996","unstructured":"Kazaz, B., & Sepil, C. (1996). Project scheduling with discounted cash flows and progress payments. Journal of the Operational Research Society, 47, 1262\u20131272.","journal-title":"Journal of the Operational Research Society"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Kelley, J. E., & Walker, M. R. (1959). Critical path planning and scheduling. In proceedings of Eastern Joint Computer Conference, Boston, December 1-3, 1959, NY 1960, pp.\u00a0160\u2013173","DOI":"10.1145\/1460299.1460318"},{"issue":"3","key":"11_CR25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10107-004-0551-6","volume":"103","author":"T. Kis","year":"2005","unstructured":"Kis, T. (2005). A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming, 103(3), 515\u2013539.","journal-title":"Mathematical Programming"},{"issue":"1","key":"11_CR26","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1287\/opre.12.1.16","volume":"12","author":"K. R. MacCrimmon","year":"1964","unstructured":"MacCrimmon, K. R., & Ryavec, C. A. (1964). An analytical study of the PERT assumptions. Operations Research, 12(1), 16\u201337.","journal-title":"Operations Research"},{"key":"11_CR27","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., & Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087\u20131092.","journal-title":"Journal of Chemical Physics"},{"issue":"3","key":"11_CR28","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/j.ejor.2003.10.053","volume":"164","author":"M. Mika","year":"2005","unstructured":"Mika, M., Waligora, G., & Weglarz, G. (2005). Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 164(3), 639\u2013668.","journal-title":"European Journal of Operational Research"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. Wiley-Interscience, Hoboken, NJ, USA","DOI":"10.1002\/9781118627372"},{"key":"11_CR30","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1080\/07408179508936773","volume":"27","author":"L. Ozdamar","year":"1995","unstructured":"Ozdamar, L., & Ulusoy, G. (1995). A survey on the resource-constrained project scheduling problem. IIE Transactions, 27, 574\u2013586.","journal-title":"IIE Transactions"},{"key":"11_CR31","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1057\/palgrave.jors.2600440","volume":"48","author":"R. Padman","year":"1997","unstructured":"Padman, R., & Dayanand, N. (1997). On modelling payments in projects. Journal of the Operational Research Society, 48, 906\u2013918.","journal-title":"Journal of the Operational Research Society"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Patterson, J. H., Slowinski, R., Talbot, F. B., & Weglarz, J. (1989). An algorithm for a general class of precedence and resource constrained scheduling problems. In R. Slowinski & J. Weglarz (Eds.), Advances in project scheduling (pp. 3\u201328). Amsterdam: Elsevier.","DOI":"10.1016\/B978-0-444-87358-3.50005-5"},{"key":"11_CR33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(90)90121-Q","volume":"49","author":"J. H. Patterson","year":"1990","unstructured":"Patterson, J. H., Slowinski, R., Talbot, F. B., & Weglarz, J. (1990). Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems. European Journal of Operational Research, 49, 68\u201367.","journal-title":"European Journal of Operational Research"},{"key":"11_CR34","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":"11_CR35","doi-asserted-by":"crossref","unstructured":"Ragsdale, C. (1989). The current state of network simulation in project management theory and practice. Omega: The International Journal of Management Science, 17, 21\u201325.","DOI":"10.1016\/0305-0483(89)90016-9"},{"issue":"1","key":"11_CR36","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ijpe.2004.10.014","volume":"100","author":"G. Ramachandra","year":"2006","unstructured":"Ramachandra, G., & Elmaghraby, S. E. (2006). Sequencing precedence-related jobs on two machines to minimize the weighted completion time. International Journal of Production Economics, 100(1), 44\u201358.","journal-title":"International Journal of Production Economics"},{"key":"11_CR37","unstructured":"Santos, M. A., & Tereso, A. P. (2010). On the multi-mode, multi-skill resource constraint project scheduling problem (MRCPSP-MS). In proceedings of 2nd International Conference on Engineering Optimization (EngOpt 2010), Lisbon, Portugal, September 6\u20139"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Santos, M. A., & Tereso, A. P. (2011a). On the multi-mode, multi-skill resource constrained project scheduling problem\u2014computational results. In proceedings of ICOPEV\u2014International Conference on Project Economic Evaluation, Guimar\u00e3es, Portugal, April 28\u201329","DOI":"10.1007\/978-3-642-20505-7_21"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Santos, M. A., & Tereso, A. P. (2011b). On the multi-mode, multi-skill resource constrained project scheduling problem\u2014A software application. In A. GasparCunha, R. Takahashi, G. Schaefer, & L. Costa (Eds.), Soft Computing in Industrial Applications, 96, 239\u2013248","DOI":"10.1007\/978-3-642-20505-7_21"},{"key":"11_CR40","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1057\/palgrave.jors.2600458","volume":"48","author":"C. Sepil","year":"1997","unstructured":"Sepil, C., & Orta\u00e7, N. (1997). Performance of the heuristic procedures for constrained projects with progress payments. Journal of the Operational Research Society, 48, 1123\u20131130.","journal-title":"Journal of the Operational Research Society"},{"key":"11_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2003.09.005","volume":"92","author":"A.P. Tereso","year":"2004","unstructured":"Tereso, A.P., Ara\u00fajo, M.M., Elmaghraby, S.E. (2004). Adaptive resource allocation in multimodal activity networks. International Journal of Production Economics, 92, 1\u201310.","journal-title":"International Journal of Production Economics"},{"key":"11_CR42","first-page":"661","volume":"35","author":"A.P. Tereso","year":"2006","unstructured":"Tereso, A.P., Mota, J.R., Lameiro, R.J. (2006). Adaptive resource allocation technique to stochastic multimodal projects: A distributed platform implementation in JAVA. Control Cybern, 35, 661\u2013686.","journal-title":"Control Cybern"},{"issue":"2","key":"11_CR43","first-page":"63","volume":"4","author":"C. Tseng","year":"2008","unstructured":"Tseng, C. (2008). Two heuristic algorithms for a multi-mode resource-constrained multi-project scheduling problem. Journal of Science and Engineering Technology, 4(2), 63\u201374.","journal-title":"Journal of Science and Engineering Technology"},{"key":"11_CR44","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/S0377-2217(99)00499-3","volume":"127","author":"G. Ulusoy","year":"2000","unstructured":"Ulusoy, G., & Cebelli, S. (2000). An equitable approach to the payment scheduling problem in project management. European Journal of Operational Research, 127, 262\u2013278.","journal-title":"European Journal of Operational Research"},{"key":"11_CR45","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1010958200070","volume":"102","author":"M. Vanhoucke","year":"2000","unstructured":"Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2000). An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research, 102, 179\u2013196.","journal-title":"Annals of Operations Research"},{"key":"11_CR46","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0377-2217(85)90026-8","volume":"21","author":"R. J. Willis","year":"1985","unstructured":"Willis, R. J. (1985). Critical path analysis and resource constrained project scheduling theory and practice. European Journal of Operational Research, 21, 149\u2013155.","journal-title":"European Journal of Operational Research"},{"key":"11_CR47","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1080\/01446190500184311","volume":"24","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., Li, H., & Tarn, C. M. (2006). Heuristic scheduling of resource-constrained, multiple-mode and repetitive projects. Construction Management and Economics, 24, 159\u2013169.","journal-title":"Construction Management and Economics"},{"key":"11_CR48","unstructured":"Zimmermann, J., & Engelhardt, H. (1998). Lower bounds and exact algorithms for resource levelling problems. Technical Report WIOR-517, University of Karlsruhe"}],"container-title":["International Series in Operations Research & Management Science","Essays in Production, Project Planning and Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-9056-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T20:50:27Z","timestamp":1716238227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-9056-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,3]]},"ISBN":["9781461490555","9781461490562"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-9056-2_11","relation":{},"ISSN":["0884-8289","2214-7934"],"issn-type":[{"type":"print","value":"0884-8289"},{"type":"electronic","value":"2214-7934"}],"subject":[],"published":{"date-parts":[[2013,12,3]]},"assertion":[{"value":"3 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}