{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:31Z","timestamp":1759667791222},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T00:00:00Z","timestamp":1475798400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10479-016-2336-8","type":"journal-article","created":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T15:30:09Z","timestamp":1475854209000},"page":"85-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources"],"prefix":"10.1007","volume":"259","author":[{"given":"Aidin","family":"Delgoshaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timon","family":"Rabczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahad","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohd Khairol Anuar","family":"Ariffin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,7]]},"reference":[{"issue":"1","key":"2336_CR1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.amc.2005.11.160","volume":"180","author":"B Abbasi","year":"2006","unstructured":"Abbasi, B., Shadrokh, S., & Arkat, J. (2006). Bi-objective resource-constrained project scheduling with robustness and makespan criteria. Applied Mathematics and Computation, 180(1), 146\u2013152.","journal-title":"Applied Mathematics and Computation"},{"issue":"1\u20134","key":"2336_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1016046625583","volume":"108","author":"N Achuthan","year":"2001","unstructured":"Achuthan, N., & Hardjawidjaja, A. (2001). Project scheduling under time dependent costs-A branch and bound algorithm. Annals of Operations Research, 108(1\u20134), 55\u201374.","journal-title":"Annals of Operations Research"},{"issue":"1\u20134","key":"2336_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1010949931021","volume":"102","author":"J Alcaraz","year":"2001","unstructured":"Alcaraz, J., & Maroto, C. (2001). A robust genetic algorithm for resource allocation in project scheduling. Annals of Operations Research, 102(1\u20134), 83\u2013109.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2336_CR4","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.ejor.2006.07.052","volume":"189","author":"F Ballest\u00edn","year":"2008","unstructured":"Ballest\u00edn, F., Valls, V., & Quintanilla, S. (2008). Pre-emption in resource-constrained project scheduling. European Journal of Operational Research, 189(3), 1136\u20131152.","journal-title":"European Journal of Operational Research"},{"key":"2336_CR5","volume-title":"An exact solution procedure for maximizing the net present value of cash flows in a network project scheduling","author":"SM Baroum","year":"1999","unstructured":"Baroum, S. M., & Patterson, J. H. (1999). An exact solution procedure for maximizing the net present value of cash flows in a network project scheduling. Berlin: Springer."},{"issue":"1","key":"2336_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ejor.2005.04.030","volume":"175","author":"J Buddhakulsomsiri","year":"2006","unstructured":"Buddhakulsomsiri, J., & Kim, D. S. (2006). Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 175(1), 279\u2013295.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2336_CR7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10479-010-0776-0","volume":"186","author":"M Castej\u00f3n-Limas","year":"2011","unstructured":"Castej\u00f3n-Limas, M., Ordieres-Mer\u00e9, J., Gonz\u00e1lez-Marcos, A., & Gonz\u00e1lez-Castro, V. (2011). Effort estimates through project complexity. Annals of Operations Research, 186(1), 395\u2013406.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2336_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.cie.2007.11.017","volume":"55","author":"H Chtourou","year":"2008","unstructured":"Chtourou, H., & Haouari, M. (2008). A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling. Computers & Industrial Engineering, 55(1), 183\u2013194.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2336_CR9","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1016\/j.ejor.2006.09.052","volume":"182","author":"J Damay","year":"2007","unstructured":"Damay, J., Quilliot, A., & Sanlaville, E. (2007). Linear programming based algorithms for preemptive and non-preemptive RCPSP. European Journal of Operational Research, 182(3), 1012\u20131022.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2336_CR10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","volume":"111","author":"B Reyck De","year":"1998","unstructured":"De Reyck, B. (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 111(1), 152\u2013174.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2336_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.24867\/IJIEM-2014-3-117","volume":"5","author":"A Delgoshaei","year":"2014","unstructured":"Delgoshaei, A., Ariffin, M. K., Baharudin, B. H. T. B., & Leman, Z. (2014). A backward approach for maximizing net present value of multi-mode pre-emptive resource-constrained project scheduling problem with discounted cash flows using simulated annealing algorithm. International Journal of Industrial Engineering and Management, 5(3), 151\u2013158.","journal-title":"International Journal of Industrial Engineering and Management"},{"key":"2336_CR12","doi-asserted-by":"crossref","unstructured":"Delgoshaei, A., Ariffin, M. K. M., Baharudin, B. H. T. B. & Leman, Z. (2015). Minimizing makespan of a resource-constrained scheduling problem: A hybrid greedy and genetic algorithms. Resource.","DOI":"10.5267\/j.ijiec.2015.5.002"},{"issue":"2","key":"2336_CR13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0377-2217(95)00358-4","volume":"90","author":"EL Demeulemeester","year":"1996","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (1996). An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research, 90(2), 334\u2013348.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2336_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0377-2217(90)90118-U","volume":"49","author":"SE 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(1), 35\u201349.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"2336_CR15","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 Operations Research, 102(1\u20134), 111\u2013135.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2336_CR16","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. European Journal of Operational Research, 207(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2336_CR17","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/0305-0548(94)90014-0","volume":"21","author":"O Icmeli","year":"1994","unstructured":"Icmeli, O., & Erenguc, S. S. (1994). A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows. Computers & Operations Research, 21(8), 841\u2013853.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"2336_CR18","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1108\/01443579310046454","volume":"13","author":"O Icmeli","year":"1993","unstructured":"Icmeli, O., Erenguc, S. S., & Zappe, C. J. (1993). Project scheduling problems: A survey. International Journal of Operations & Production Management, 13(11), 80\u201391.","journal-title":"International Journal of Operations & Production Management"},{"issue":"1","key":"2336_CR19","doi-asserted-by":"crossref","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. Applied Mathematics and Computation, 195(1), 299\u2013308.","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"2336_CR20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.apm.2009.04.011","volume":"34","author":"H Ke","year":"2010","unstructured":"Ke, H., & Liu, B. (2010). Fuzzy project scheduling problem and its hybrid intelligent algorithm. Applied Mathematical Modelling, 34(2), 301\u2013308.","journal-title":"Applied Mathematical Modelling"},{"key":"2336_CR21","first-page":"347","volume":"13","author":"JE Kelley","year":"1963","unstructured":"Kelley, J. E. (1963). The critical-path method: Resources planning and scheduling. Industrial Scheduling, 13, 347\u2013365.","journal-title":"Industrial Scheduling"},{"issue":"2","key":"2336_CR22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.compind.2004.06.006","volume":"56","author":"K Kim","year":"2005","unstructured":"Kim, K., Yun, Y., Yoon, J., Gen, M., & Yamazaki, G. (2005). Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling. Computers in Industry, 56(2), 143\u2013160.","journal-title":"Computers in Industry"},{"issue":"2","key":"2336_CR23","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. European Journal of Operational Research, 90(2), 320\u2013333.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2336_CR24","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 Transactions, 29(11), 987\u2013999.","journal-title":"IIE Transactions"},{"issue":"6","key":"2336_CR25","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.ijproman.2009.10.001","volume":"28","author":"Z Laslo","year":"2010","unstructured":"Laslo, Z. (2010). Project portfolio management: An integrated method for resource planning and scheduling to minimize planning\/scheduling-dependent expenses. International Journal of Project Management, 28(6), 609\u2013618.","journal-title":"International Journal of Project Management"},{"issue":"1\u20134","key":"2336_CR26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1010918518726","volume":"102","author":"CY Lee","year":"2001","unstructured":"Lee, C. Y., & Lei, L. (2001). Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases. Annals of Operations Research, 102(1\u20134), 287\u2013307.","journal-title":"Annals of Operations Research"},{"issue":"1\u20134","key":"2336_CR27","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1010966401888","volume":"102","author":"A Lova","year":"2001","unstructured":"Lova, A., & Tormos, P. (2001). Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling. Annals of Operations Research, 102(1\u20134), 263\u2013286.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2336_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., Walig\u00f3ra, G., & W\u0119glarz, J. (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"},{"issue":"5","key":"2336_CR29","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","volume":"16","author":"A Russell","year":"1970","unstructured":"Russell, A. (1970). Cash flows in networks. Management Science, 16(5), 357\u2013373.","journal-title":"Management Science"},{"issue":"4","key":"2336_CR30","first-page":"347","volume":"21","author":"M Seifi","year":"2008","unstructured":"Seifi, M., & Tavakkoli-Moghaddam, R. (2008). A new bi-objective model for a multi-mode resource-constrained project scheduling problem with discounted cash flows and four payment models. International Journal of Engineering, Transaction A: Basic, 21(4), 347\u2013360.","journal-title":"International Journal of Engineering, Transaction A: Basic"},{"issue":"5","key":"2336_CR31","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1287\/mnsc.46.5.710.12044","volume":"46","author":"A Sprecher","year":"2000","unstructured":"Sprecher, A. (2000). Scheduling resource-constrained projects competitively at modest memory requirements. Management Science, 46(5), 710\u2013723.","journal-title":"Management Science"},{"issue":"2","key":"2336_CR32","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0925-5273(94)90169-4","volume":"37","author":"C Sung","year":"1994","unstructured":"Sung, C., & Lim, S. (1994). A project activity scheduling problem with net present value measure. International Journal of Production Economics, 37(2), 177\u2013187.","journal-title":"International Journal of Production Economics"},{"issue":"10","key":"2336_CR33","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot, F. B. (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 28(10), 1197\u20131210.","journal-title":"Management Science"},{"issue":"1\u20134","key":"2336_CR34","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1010914417817","volume":"102","author":"G Ulusoy","year":"2001","unstructured":"Ulusoy, G., Sivrikaya-\u015eerifo\u011flu, F., & \u015eahin, \u015e. (2001). Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Annals of Operations Research, 102(1\u20134), 237\u2013261.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2336_CR35","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ijpe.2004.08.004","volume":"97","author":"S Vonder Van de","year":"2005","unstructured":"Van de Vonder, S., Demeulemeester, E., Herroelen, W., & Leus, R. (2005). The use of buffers in project management: The trade-off between stability and makespan. International Journal of Production Economics, 97(2), 227\u2013240.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"2336_CR36","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1080\/00207540500140914","volume":"44","author":"S Vonder Van de","year":"2006","unstructured":"Van de Vonder, S., Demeulemeester, E., Herroelen, W., & Leus, R. (2006). The trade-off between stability and makespan in resource-constrained project scheduling. International Journal of Production Research, 44(2), 215\u2013236.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"2336_CR37","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Peteghem Van","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. European Journal of Operational Research, 201(2), 409\u2013418.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2336_CR38","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cie.2007.07.001","volume":"54","author":"M Vanhoucke","year":"2008","unstructured":"Vanhoucke, M., & Debels, D. (2008). The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Computers & Industrial Engineering, 54(1), 140\u2013154.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2336_CR39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J W\u0119glarz","year":"2011","unstructured":"W\u0119glarz, J., J\u00f3zefowska, J., Mika, M., & Walig\u00f3ra, G. (2011). Project scheduling with finite or infinite number of activity processing modes: A survey. European Journal of Operational Research, 208(3), 177\u2013205.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2336_CR40","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ijproman.2008.10.001","volume":"27","author":"L Yan","year":"2009","unstructured":"Yan, L., Jinsong, B., Xiaofeng, H., & Ye, J. (2009). A heuristic project scheduling approach for quick response to maritime disaster rescue. International Journal of Project Management, 27(6), 620\u2013628.","journal-title":"International Journal of Project Management"},{"issue":"1","key":"2336_CR41","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10479-010-0819-6","volume":"197","author":"L Yu","year":"2012","unstructured":"Yu, L., Wang, S., Wen, F., & Lai, K. K. (2012). Genetic algorithm-based multi-criteria project portfolio selection. Annals of Operations Research, 197(1), 71\u201386.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2336_CR42","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0360-8352(97)00157-5","volume":"34","author":"M Zhou","year":"1998","unstructured":"Zhou, M., & Askin, R. G. (1998). Formation of general GT cells: An operation-based approach. Computers & Industrial Engineering, 34(1), 147\u2013157.","journal-title":"Computers & Industrial Engineering"},{"issue":"8","key":"2336_CR43","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1002\/(SICI)1520-6750(199912)46:8<912::AID-NAV3>3.0.CO;2-C","volume":"46","author":"D Zhu","year":"1999","unstructured":"Zhu, D., & Padman, R. (1999). A metaheuristic scheduling procedure for resource-constrained projects with cash flows. Naval Research Logistics (NRL), 46(8), 912\u2013927.","journal-title":"Naval Research Logistics (NRL)"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2336-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2336-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2336-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T10:56:12Z","timestamp":1692528972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2336-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,7]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2336"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2336-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,7]]}}}