{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:58:26Z","timestamp":1781168306856,"version":"3.54.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,2,14]],"date-time":"2015-02-14T00:00:00Z","timestamp":1423872000000},"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":[[2016,5]]},"DOI":"10.1007\/s00500-015-1610-z","type":"journal-article","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T07:38:53Z","timestamp":1423813133000},"page":"1879-1896","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Taking advantage of solving the resource constrained multi-project scheduling problems using multi-modal genetic algorithms"],"prefix":"10.1007","volume":"20","author":[{"given":"E.","family":"P\u00e9rez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Posada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Lorenzana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"1610_CR1","doi-asserted-by":"crossref","unstructured":"Ash R (1999) Activity scheduling in the dynamic multi-project setting: choosing heuristics through deterministic simulation. In: Farrington PA, Nembhard HB, Sturrock DT, Evans GW (eds) Proceedings of the 1999 Winter Simulation Conference, Pheoenix, pp 937\u2013941","DOI":"10.1145\/324898.324933"},{"key":"1610_CR2","volume-title":"Introduction to sequencing and scheduling","author":"K Baker","year":"1974","unstructured":"Baker K (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"issue":"11","key":"1610_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Operat Res Soc 41(11):1069\u20131072","journal-title":"J Operat Res Soc"},{"key":"1610_CR4","author":"FF Boctor","year":"1990","unstructured":"Boctor FF (1990) Some efficient multi-heuristic procedures for resource constrained project scheduling. Eur J Oper Res. doi: 10.1016\/0377-2217(90)90116-S","journal-title":"Eur J Oper Res"},{"key":"1610_CR5","doi-asserted-by":"crossref","unstructured":"Browning T, Yassine A (2010) Resource-constrained multi-project scheduling: priority rule performance revisited. Int J Prod Econ. doi: 10.1016\/j.ijpe.2010.03.009","DOI":"10.1016\/j.ijpe.2010.03.009"},{"key":"1610_CR6","doi-asserted-by":"crossref","unstructured":"Browning T, Yassine A (2010b) A random generator of resource-constrained multi-project network problems. J Sched. doi: 10.1007\/s10951-009-0131-y","DOI":"10.1007\/s10951-009-0131-y"},{"key":"1610_CR7","author":"P Brucker","year":"1999","unstructured":"Brucker P, Drexl A, M\u00f6hring RH, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models and algorithms. Eur J Oper Res. doi: 10.1016\/S0377-2217(98)00204-5","journal-title":"Eur J Oper Res"},{"key":"1610_CR8","unstructured":"Cavichio D (1970) Adaptive search using simulated evolution. PhD Thesis, University of Michigan"},{"key":"1610_CR9","doi-asserted-by":"crossref","unstructured":"Chen P, Shahandashti S (2009) Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints. Autom Constr. doi: 10.1016\/j.autcon.2008.10.007","DOI":"10.1016\/j.autcon.2008.10.007"},{"key":"1610_CR10","doi-asserted-by":"crossref","unstructured":"Chen JC, Jaong W, Sun C, Lee H, Wu J, Ku C (2010) Applying genetic algorithm to resource contsrained multi-project scheduling problems. Key Eng Mater. doi: 10.4028\/www.scientific.net\/KEM.419-420.633","DOI":"10.4028\/www.scientific.net\/KEM.419-420.633"},{"key":"1610_CR11","doi-asserted-by":"crossref","unstructured":"Chiu HN, Tsai DM (2002) An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows. Constr Manag Econ. doi: 10.1080\/01446190110089718","DOI":"10.1080\/01446190110089718"},{"key":"1610_CR12","unstructured":"Confessore G, Giordani S, Rismondo S (2002) An auction based approach in decentralized project scheduling. In: International workshop on project management and scheduling, Valencia, pp 110\u2013113"},{"key":"1610_CR13","first-page":"375","volume-title":"Proceedings of the 3th international conference on genetic algorithms","author":"L Davis","year":"1989","unstructured":"Davis L (1989) Adapting operators probabilities in genetic algorithms. In: Schaffer JD (ed) Proceedings of the 3th international conference on genetic algorithms. Kaufmann, San Mateo, pp 375\u2013378"},{"key":"1610_CR14","author":"B Reyck De","year":"1996","unstructured":"De Reyck B, Herroelen W (1996) On the use of the complexity index as a measure of complexity in activity networks. Eur J Oper Res. doi: 10.1016\/0377-2217(94)00344-0","journal-title":"Eur J Oper Res"},{"key":"1610_CR15","author":"RF Deckro","year":"1991","unstructured":"Deckro RF, Winkofsky EP, Hebert JE, Gagnon R (1991) A decomposition approach to multi-project scheduling. Eur J Oper Res. doi: 10.1016\/0377-2217(91)90149-P","journal-title":"Eur J Oper Res"},{"key":"1610_CR16","author":"B Dodin","year":"1998","unstructured":"Dodin B, Elimam AA, Rolland E (1998) Tabu search in audit scheduling. Eur J Oper Res. doi: 10.1016\/S0377-2217(97)00280-4","journal-title":"Eur J Oper Res"},{"key":"1610_CR17","volume-title":"Introduction to evolutionary computing (Natural Computing Series)","author":"AE Eiben","year":"2007","unstructured":"Eiben AE, Smith JE (2007) Introduction to evolutionary computing (Natural Computing Series). Springer, Berlin"},{"key":"1610_CR18","doi-asserted-by":"crossref","unstructured":"Forrest S, Mitchell M (1993) What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation, Mach Learn. doi: 10.1007\/BF00993046","DOI":"10.1007\/BF00993046"},{"key":"1610_CR19","doi-asserted-by":"crossref","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study. CEC\u20192005 Special session on real parameter optimization. J Heuristics, 1007. doi: 10.1007\/s10732-008-9080-4","DOI":"10.1007\/s10732-008-9080-4"},{"key":"1610_CR20","doi-asserted-by":"crossref","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci. doi: 10.1016\/j.ins.2009.12.010","DOI":"10.1016\/j.ins.2009.12.010"},{"key":"1610_CR21","unstructured":"Gento AM, P\u00e9rez ME (2002) Study on the genetic operators for the job shop problem. In: Proceedings of the first Spanish conference on evolutionary and bioinspired algorithms. M\u00e9rida, pp 523\u2013530 (in spanish)"},{"key":"1610_CR22","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-wesley, Massachusetts"},{"key":"1610_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The design of innovation: lessons from and for competent genetic algorithms","author":"DE Goldberg","year":"2002","unstructured":"Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Boston"},{"key":"1610_CR24","author":"JF Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res. doi: 10.1016\/j.ejor.2006.06.074","journal-title":"Eur J Oper Res"},{"key":"1610_CR25","first-page":"160","volume-title":"Proceedings of the first international conference on genetic algorithms","author":"J Grefenstette","year":"1985","unstructured":"Grefenstette J, Gopal R, Rosmaita R, Gucht D (1985) Genetic algorithms for the traveling salesman problem. Proceedings of the first international conference on genetic algorithms. Lawrence Eribaum Associates, Mahwah, NJ, pp 160\u2013168"},{"key":"1610_CR26","author":"S Hartmann","year":"2000","unstructured":"Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res. doi: 10.1016\/S0377-2217(99)00485-3","journal-title":"Eur J Oper Res"},{"key":"1610_CR27","unstructured":"Herroelen WS (2005) Project scheduling: theory and practice. Prod Oper Manag. doi: 10.5555\/ijop.2005.14.4.413"},{"key":"1610_CR28","doi-asserted-by":"crossref","unstructured":"Jinghua L, Wenjian L (2005) An agent-based system for multi-project planning and scheduling. In: Proceedings of the IEEE international conference on mechatronics and automation, pp 659\u2013664","DOI":"10.1109\/ICMA.2005.1626628"},{"key":"1610_CR29","doi-asserted-by":"crossref","unstructured":"Kim JL (2009) Proposed methodology for comparing schedule generation schemes in construction resource scheduling. In: Proceedings of the winter simulation conference (WSC), pp 2745\u20132750","DOI":"10.1109\/WSC.2009.5429252"},{"key":"1610_CR30","first-page":"197","volume-title":"Handbook on recent advances in project scheduling","author":"R Kolisch","year":"1998","unstructured":"Kolisch R, Schwindt C, Sprecher A (1998) Benchmark instances for scheduling problems. In: Weglarz J (ed) Handbook on recent advances in project scheduling. Kluwer, Amsterdam, pp 197\u2013212"},{"key":"1610_CR31","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz J (ed) Handbook on recent advances in project scheduling, Kluwer Academic Publishers, Boston pp 147\u2013178"},{"key":"1610_CR32","doi-asserted-by":"crossref","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res. doi: 10.1016\/j.ejor.2005.01.065","DOI":"10.1016\/j.ejor.2005.01.065"},{"key":"1610_CR33","unstructured":"Kotwani K, Yassine A, Zhao Y (2006) Scheduling resource constrained multi project DSM using modified simple GA and omeGA. Working Paper, Dept. of IESE, UIUC"},{"key":"1610_CR34","doi-asserted-by":"crossref","unstructured":"Kumanan S, Jegan G, Raja K (2006) Multi-project scheduling using a heuristic and a genetic algorithm. Int J Adv Manuf Technol. doi: 10.1007\/s00170-005-0199-2","DOI":"10.1007\/s00170-005-0199-2"},{"key":"1610_CR35","doi-asserted-by":"crossref","unstructured":"Kurtulus I, Davis EW (1982) Multi-project scheduling: categorization of heuristic rules performance. Manag Sci. doi: 10.1287\/mnsc.28.2.161","DOI":"10.1287\/mnsc.28.2.161"},{"key":"1610_CR36","doi-asserted-by":"crossref","unstructured":"Liberatore MJ, Pollack-Johnson B (2003) Factors influencing the usage and selection of project management software. IIEEE Trans Eng Manag. doi: 10.1109\/TEM.2003.810821","DOI":"10.1109\/TEM.2003.810821"},{"key":"1610_CR37","doi-asserted-by":"crossref","unstructured":"Linyi D, Yan L (2007) A particle swarm optimization for resource-constrained multi-project scheduling problem. In: International conference on computational intelligence and security, pp 1010\u20131014","DOI":"10.1109\/CIS.2007.157"},{"key":"1610_CR38","doi-asserted-by":"crossref","unstructured":"Lova A, Maroto C, Tormos P (2000) A multicriteria heuristic algorithm to improve resource allocation in multi-project scheduling. Eur J Oper Res. doi: 10.1016\/S0377-2217(99)00490-7","DOI":"10.1016\/S0377-2217(99)00490-7"},{"key":"1610_CR39","doi-asserted-by":"crossref","unstructured":"Lova A, Tormos P (2001) Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling. Ann Oper Res. doi: 10.1023\/A:1010966401888","DOI":"10.1023\/A:1010966401888"},{"key":"1610_CR40","unstructured":"Mahfoud SW (1992) Crowding and preservation revisited. In: Manderick B, M\u00e4nner R (ed) Parallel problem solving form nature II. Elsevier, pp 27\u201336"},{"key":"1610_CR41","first-page":"390","volume":"1","author":"Z Man","year":"2008","unstructured":"Man Z, Wei T, Xiang L, Lishan K (2008) Research on multi-project scheduling problem based on hybrid genetic algorithm. Int Conf Comput Sci Softw Eng 1:390\u2013394","journal-title":"Int Conf Comput Sci Softw Eng"},{"key":"1610_CR42","volume-title":"Project scheduling: recent models algorithms and applications","author":"C Maroto","year":"1999","unstructured":"Maroto C, Tormos P, Lova A (1999) The evolution of software quality in project scheduling. In: Weglarz J (ed) Project scheduling: recent models algorithms and applications. Kluwer, Boston"},{"key":"1610_CR43","volume-title":"Evolutionary search and the job shop Investigations on genetic algorithms for production scheduling","author":"DC Mattfeld","year":"1995","unstructured":"Mattfeld DC (1995) Evolutionary search and the job shop Investigations on genetic algorithms for production scheduling. Springer, Berlin"},{"key":"1610_CR44","volume-title":"Genetic algorithms + Data structures + Evolutions programs","author":"Z Michalewicz","year":"1995","unstructured":"Michalewicz Z (1995) Genetic algorithms + Data structures + Evolutions programs. Springer, Berlin"},{"key":"1610_CR45","author":"JH Payne","year":"1995","unstructured":"Payne JH (1995) Management of multiple simultaneous projects: a state-of-the-art review. Int J Proj Manag. doi: 10.1016\/0263-7863(94)00019-9","journal-title":"Int J Proj Manag"},{"key":"1610_CR46","author":"E P\u00e9rez","year":"2003","unstructured":"P\u00e9rez E, Herrera F, Hern\u00e1ndez C (2003) Finding multiple solutions in job shop scheduling by niching genetic algorithms. J Intell Manuf. doi: 10.1023\/A:1024649709582","journal-title":"J Intell Manuf"},{"key":"1610_CR47","author":"E P\u00e9rez","year":"2013","unstructured":"P\u00e9rez E, Posada M, Mart\u00edn P (2013) Learning process on priority rules to solve the RCMPSP. J Intell Manuf. doi: 10.1007\/s10845-013-0767-5","journal-title":"J Intell Manuf"},{"key":"1610_CR48","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski A (1996) A clearing procedure as a niching algorithm for genetic algorithms. In: Proceedings of IEEE International conference on evolutionary computation. Japan, pp 798\u2013803","DOI":"10.1109\/ICEC.1996.542703"},{"key":"1610_CR49","unstructured":"P\u00e9trowski A (1997) A new selection operator dedicated to speciatin. In: B\u00e4ck T (ed). Proceedings of the 7th international conference on genetic algorithms, pp 144\u2013151"},{"key":"1610_CR50","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"B Pritsker","year":"1969","unstructured":"Pritsker B, Watters LJ, Wolfe PM (1969) Multi-project scheduling with limited resources: a zero-one programming approach. Manag Sci 16:93\u2013108","journal-title":"Manag Sci"},{"key":"1610_CR51","unstructured":"Sareni B, Krahenbuhl L (1998) Fitness sharing and niching algorithms revisited. IEEE Trans Evol Comput. doi: 10.1109\/4235:735432"},{"key":"1610_CR52","unstructured":"Schwindt C (1995) ProGen\/max: a new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags. Technical report WIOR-449, Universitat Karlsruhe, Germany"},{"key":"1610_CR53","volume-title":"Introduction to genetic algorithms","author":"SN Sivanandam","year":"2007","unstructured":"Sivanandam SN, Deepa SN (2007) Introduction to genetic algorithms. Springer, Berlin"},{"key":"1610_CR54","author":"A Sprecher","year":"1995","unstructured":"Sprecher A, Kolisch R, Drexel A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduleing problem. Eur J Oper Res. doi: 10.1016\/0377-2217(93)E0294-8","journal-title":"Eur J Oper Res"},{"key":"1610_CR55","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TEM.1981.6448589","volume":"28","author":"D Steward","year":"1981","unstructured":"Steward D (1981) The design structure system: a method for managing the design of complex systems. IEEE Trans on Eng Manag 28:71\u201374","journal-title":"IEEE Trans on Eng Manag"},{"key":"1610_CR56","unstructured":"Syswerda G (1991) Schedule optimization using genetic algorithms. In: Davis L (ed) Handbook of genetic algorithms, Van Nostrand Reinhold, pp 332\u2013349"},{"key":"1610_CR57","volume-title":"The handbook of project-based management","author":"JR Turner","year":"1993","unstructured":"Turner JR (1993) The handbook of project-based management. McGraw-Hill, UK"},{"key":"1610_CR58","unstructured":"Vanhoucke M, Coello J, Debels D, Tavares LV (2004). On the morphological structure of a network. Vlerick Leuven Gent Management School, Working Paper no 2004\/9"},{"key":"1610_CR59","doi-asserted-by":"crossref","unstructured":"Zhuang M, Yassine AA (2004) Task scheduling of parallel development projects using genetic algorithms. In: Proceedings of 30th international design engineering technical conferences and computers and information in engineering conference, pp 215\u2013224","DOI":"10.1115\/DETC2004-57159"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1610-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1610-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1610-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:45Z","timestamp":1559094225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1610-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,14]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1610"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1610-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,14]]}}}