{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:43:46Z","timestamp":1773737026718,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:00:00Z","timestamp":1407888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00500-014-1395-5","type":"journal-article","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:27:52Z","timestamp":1407839272000},"page":"2111-2132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An outer\u2013inner fuzzy cellular automata algorithm for dynamic uncertainty multi-project scheduling problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Wenbin","family":"Hu","sequence":"first","affiliation":[]},{"given":"Huan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Huang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Huangle","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,13]]},"reference":[{"issue":"8","key":"1395_CR1","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1016\/j.engappai.2011.12.003","volume":"25","author":"S Adhau","year":"2012","unstructured":"Adhau S, Mittal ML, Mittal A (2012) A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach. Eng Appl Artif Intell 25(8):1738\u20131751","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"1395_CR2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.advengsoft.2011.10.004","volume":"45","author":"P Alcan","year":"2012","unstructured":"Alcan P, Ba\u015fL\u0131Gil H (2012) A genetic algorithm application using fuzzy processing times in non-identical parallel machine scheduling problem. Adv Eng Softw 45(1):272\u2013280","journal-title":"Adv Eng Softw"},{"issue":"4","key":"1395_CR3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1111\/j.1467-8640.2010.00365.x","volume":"26","author":"RM Aliguliyev","year":"2010","unstructured":"Aliguliyev RM (2010) Clustering techniques and discrete particle swarm optimization algorithm for multi-document summarization. Comput Intell 26(4):420\u2013448","journal-title":"Comput Intell"},{"issue":"3","key":"1395_CR4","first-page":"355","volume":"14","author":"M Amiri","year":"2013","unstructured":"Amiri M, Abtahi AR, Khalili-Damghani K (2013) Solving a generalized precedence multi-objective multi-mode time-cost-quality trade-off project scheduling problem using a modified NSGA-II algorithm. Int J Serv Oper Manag 14(3):355\u2013372","journal-title":"Int J Serv Oper Manag"},{"issue":"7","key":"1395_CR5","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/71.707547","volume":"9","author":"AK Amoura","year":"1998","unstructured":"Amoura AK, Bampis E, Konig JC (1998) Scheduling algorithms for parallel Gaussian elimination with communication costs. IEEE Trans Parallel Distrib Syst 9(7):679\u2013686","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"1395_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2010.07.021","volume":"208","author":"T Bhaskar","year":"2011","unstructured":"Bhaskar T, Pal MN, Pal AK (2011) A heuristic method for RCPSP with fuzzy activity times. Eur J Oper Res 208(1):57\u201366","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1395_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2011.12.019","volume":"219","author":"L Bianco","year":"2012","unstructured":"Bianco L, Caramia M (2012) An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations. Eur J Oper Res 219(1):73\u201385","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1395_CR8","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ijpe.2010.03.009","volume":"126","author":"TR Browning","year":"2010","unstructured":"Browning TR, Yassine AA (2010) Resource-constrained multi-project scheduling: priority rule performance revisited. Int J Prod Econ 126(2):212\u2013228","journal-title":"Int J Prod Econ"},{"issue":"2","key":"1395_CR9","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ijproman.2011.05.005","volume":"30","author":"MC Cani\u00ebls","year":"2012","unstructured":"Cani\u00ebls MC, Bakens RJ (2012) The effects of Project Management Information Systems on decision making in a multi project environment. Int J Proj Manag 30(2):162\u2013175","journal-title":"Int J Proj Manag"},{"issue":"3","key":"1395_CR10","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.eswa.2009.07.024","volume":"37","author":"RM Chen","year":"2010","unstructured":"Chen RM, Wu CL, Wang CM, Lo ST (2010a) Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB. Expert Syst Appl 37(3):1899\u20131910","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1395_CR11","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ins.2009.11.044","volume":"180","author":"W Chen","year":"2010","unstructured":"Chen W, Shi YJ, Teng HF, Lan XP, Hu LC (2010b) An efficient hybrid algorithm for resource-constrained project scheduling. Inf Sci 180(6):1031\u20131039","journal-title":"Inf Sci"},{"issue":"1","key":"1395_CR12","doi-asserted-by":"crossref","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(1):73\u201382","journal-title":"Eur J Oper Res"},{"key":"1395_CR13","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Clifford Stein CU (2001) Introduction to algorithms. MIT Press, Cambridge"},{"issue":"3","key":"1395_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-8191(88)90070-1","volume":"6","author":"M Cosnard","year":"1988","unstructured":"Cosnard M, Marrakchi M, Robert Y, Trystram D (1988) Parallel Gaussian elimination on an MIMD computer. Parallel Comput 6(3):275\u2013296","journal-title":"Parallel Comput"},{"issue":"3","key":"1395_CR15","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. Eur J Oper Res 182(3):1012\u20131022","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1395_CR16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.ejor.2011.04.019","volume":"214","author":"F Deblaere","year":"2011","unstructured":"Deblaere F, Demeulemeester E, Herroelen W (2011) Proactive policies for the stochastic resource-constrained project scheduling problem. Eur J Oper Res 214(2):308\u2013316","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1395_CR17","doi-asserted-by":"crossref","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(1):31\u201341","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1395_CR18","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1016\/j.cor.2011.07.010","volume":"39","author":"C Fang","year":"2012","unstructured":"Fang C, Wang L (2012) An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res 39(5):890\u2013901","journal-title":"Comput Oper Res"},{"key":"1395_CR19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.autcon.2012.11.014","volume":"30","author":"P Ghoddousi","year":"2013","unstructured":"Ghoddousi P, Eshtehardian E, Jooybanpour S, Javanmardi A (2013) Multi-mode resource-constrained discrete time-cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Autom Constr 30:216\u2013227","journal-title":"Autom Constr"},{"issue":"3","key":"1395_CR20","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.ejor.2011.08.010","volume":"216","author":"P Godinho","year":"2012","unstructured":"Godinho P, Branco FG (2012) Adaptive policies for multi-mode project scheduling under uncertainty. Eur J Oper Res 216(3):553\u2013562","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1395_CR21","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"JF Goncalves","year":"2008","unstructured":"Goncalves JF, Mendes JJ, Resende MG (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res 189(3):1171\u20131190","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1395_CR22","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(2):289\u2013306","journal-title":"Eur J Oper Res"},{"issue":"11","key":"1395_CR23","first-page":"2398","volume":"18","author":"WB Hu","year":"2012","unstructured":"Hu WB, Yue Y, Xu L, Wang KK, Xia Ch, Du B, Song W (2012) Resource constrained multi-project scheduling modeling under certainty and uncertainty duration. Comput Integr Manuf Syst 18(11):2398\u20132408","journal-title":"Comput Integr Manuf Syst"},{"issue":"3","key":"1395_CR24","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1111\/j.0824-7935.2004.00248.x","volume":"20","author":"JC Jeon","year":"2004","unstructured":"Jeon JC, Yoo KY (2004) Design of Montgomery multiplication architecture based on programmable cellular automata. Comput Intell 20(3):495\u2013502","journal-title":"Comput Intell"},{"issue":"12","key":"1395_CR25","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1016\/j.cor.2010.03.002","volume":"37","author":"E Klerides","year":"2010","unstructured":"Klerides E, Hadjiconstantinou E (2010) A decomposition-based stochastic programming approach for the project scheduling problem under time\/cost trade-off settings and uncertain durations. Comput Oper Res 37(12):2131\u20132140","journal-title":"Comput Oper Res"},{"issue":"1","key":"1395_CR26","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1111\/j.1467-8640.2010.00369.x","volume":"27","author":"D Klus\u00e1\u010dek","year":"2011","unstructured":"Klus\u00e1\u010dek D, Rudov\u00e1 H (2011) Efficient grid scheduling through the incremental schedule-based approach. Comput Intell 27(1):4\u201322","journal-title":"Comput Intell"},{"issue":"5","key":"1395_CR27","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.ijproman.2008.08.004","volume":"27","author":"YH Kwak","year":"2009","unstructured":"Kwak YH, Anbari FT (2009) Analyzing project management research: perspectives from top management journals. Int J Proj Manag 27(5):435\u2013446","journal-title":"Int J Proj Manag"},{"key":"1395_CR28","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.compchemeng.2011.06.007","volume":"36","author":"TS Kyriakidis","year":"2012","unstructured":"Kyriakidis TS, Kopanos GM, Georgiadis MC (2012) MILP formulations for single-and multi-mode resource-constrained project scheduling problems. Comput Chem Eng 36:369\u2013385","journal-title":"Comput Chem Eng"},{"key":"1395_CR29","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.ejor.2012.05.029","volume":"222","author":"A Lamghari","year":"2012","unstructured":"Lamghari A, Dimitrakopoulos R (2012) A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty. Eur J Oper Res 222:642\u2013652","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1395_CR30","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1080\/00207540600800326","volume":"45","author":"J Lancaster","year":"2007","unstructured":"Lancaster J, Ozbayrak M (2007) Evolutionary algorithms applied to project scheduling problems\u2013a survey of the state-of-the-art. Int J Prod Res 45(2):425\u2013450","journal-title":"Int J Prod Res"},{"key":"1395_CR31","doi-asserted-by":"crossref","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(2):302\u2013316","DOI":"10.1016\/j.ijpe.2008.11.002"},{"key":"1395_CR32","doi-asserted-by":"crossref","unstructured":"Maravas A, Pantouvakis JP (2012) Project cash flow analysis in the presence of uncertainty in activity duration and cost. Int J Proj Manag 30(3):374\u2013384","DOI":"10.1016\/j.ijproman.2011.08.005"},{"key":"1395_CR33","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.engappai.2012.07.012","volume":"26","author":"M Masmoudi","year":"2013","unstructured":"Masmoudi M, Hait A (2013) Project scheduling under uncertainty using fuzzy modeling and solving techniques. Eng Appl Artif Intell 26:135\u2013149","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"1395_CR34","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"VV Peteghem","year":"2010","unstructured":"Peteghem VV, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201(2):409\u2013418","journal-title":"Eur J Oper Res"},{"key":"1395_CR35","unstructured":"Project Scheduling Problem Library-PSPLIB.\u00a0 http:\/\/www.om-db.wi.tum.de\/psplib\/main.html"},{"issue":"1","key":"1395_CR36","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.cie.2011.09.013","volume":"62","author":"M Ranjbar","year":"2012","unstructured":"Ranjbar M, Khalilzadeh M, Kianfar F, Etminani K (2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62(1):264\u2013270","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1395_CR37","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1467-8640.2007.00299.x","volume":"23","author":"Y Saez","year":"2007","unstructured":"Saez Y, Quintana D, Isasi P, Mochon A (2007) Effects of a rationing rule on the Ausubel auction: a genetic algorithm implementation. Comput Intell 23(2):221\u2013235","journal-title":"Comput Intell"},{"issue":"4","key":"1395_CR38","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ijproman.2011.11.003","volume":"30","author":"Q Shi","year":"2012","unstructured":"Shi Q, Blomquist T (2012) A new approach for project scheduling using fuzzy dependency structure matrix. Int J Proj Manag 30(4):503\u2013510","journal-title":"Int J Proj Manag"},{"issue":"1","key":"1395_CR39","first-page":"51","volume":"44","author":"YY Shou","year":"2009","unstructured":"Shou YY, Fu A (2009) Multi-colony ant algorithm for multi-objective resource-constrained project scheduling. J Zhejiang Univ (Eng Sci) 44(1):51\u201355","journal-title":"J Zhejiang Univ (Eng Sci)"},{"issue":"7","key":"1395_CR40","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1016\/j.cor.2011.08.011","volume":"39","author":"JG Szmerekovsky","year":"2012","unstructured":"Szmerekovsky JG, Venkateshan P (2012) An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs. Comput Oper Res 39(7):1402\u20131410","journal-title":"Comput Oper Res"},{"issue":"7","key":"1395_CR41","doi-asserted-by":"crossref","first-page":"2141","DOI":"10.1016\/j.cor.2006.09.022","volume":"35","author":"G Walig\u00f3ra","year":"2008","unstructured":"Walig\u00f3ra G (2008) Discrete-continuous project scheduling with discounted cash flows\u2013a tabu search approach. Comput Oper Res 35(7):2141\u20132153","journal-title":"Comput Oper Res"},{"issue":"20","key":"1395_CR42","doi-asserted-by":"crossref","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. Inf Sci 181(20):4804\u20134822","journal-title":"Inf Sci"},{"key":"1395_CR43","doi-asserted-by":"crossref","first-page":"2451","DOI":"10.1016\/j.eswa.2011.08.095","volume":"39","author":"L Wang","year":"2012","unstructured":"Wang L, Chen F (2012a) A hybrid estimation of distribution algorithm for solving the resource-constrained project scheduling problem. Expert Syst Appl 39:2451\u20132460","journal-title":"Expert Syst Appl"},{"key":"1395_CR44","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.cor.2011.05.008","volume":"39","author":"L Wang","year":"2012","unstructured":"Wang L, Chen F (2012b) 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"},{"issue":"2","key":"1395_CR45","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2009.05.045","volume":"202","author":"W Wiesemann","year":"2010","unstructured":"Wiesemann W, Kuhn D, Rustem B (2010) Maximizing the net present value of a project under uncertainty. Eur J Oper Res 202(2):356\u2013367","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1395_CR46","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.ijproman.2011.02.005","volume":"30","author":"K Yaghootkar","year":"2012","unstructured":"Yaghootkar K, Gil N (2012) The effects of schedule-driven project management in multi-project environments. Int J Proj Manag 30(1):127\u2013140","journal-title":"Int J Proj Manag"},{"issue":"4","key":"1395_CR47","doi-asserted-by":"crossref","first-page":"3720","DOI":"10.1016\/j.asoc.2011.02.002","volume":"11","author":"K Ziarati","year":"2011","unstructured":"Ziarati K, Akbari R, Zeighami V (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput 11(4):3720\u20133733","journal-title":"Appl Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1395-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1395-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1395-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:40Z","timestamp":1559094220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1395-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,13]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["1395"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1395-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,13]]}}}