{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:14:31Z","timestamp":1770524071333,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"International Scientific and Techological Cooperation Project of Dongguan","award":["2016508102011"],"award-info":[{"award-number":["2016508102011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00607-018-00693-1","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T07:48:45Z","timestamp":1546933725000},"page":"547-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":98,"title":["Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms"],"prefix":"10.1007","volume":"101","author":[{"given":"Erfan Babaee","family":"Tirkolaee","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Goli","sequence":"additional","affiliation":[]},{"given":"Milad","family":"Hematian","sequence":"additional","affiliation":[]},{"given":"Arun Kumar","family":"Sangaiah","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,7]]},"reference":[{"issue":"11","key":"693_CR1","doi-asserted-by":"publisher","first-page":"4057","DOI":"10.5897\/AJBM11.1628","volume":"6","author":"R Aboutalebi","year":"2012","unstructured":"Aboutalebi R, Najafi A, Ghorashi B (2012) Solving multi-mode resource-constrained project scheduling problem using two multi objective evolutionary algorithms. Afr J Bus Manag 6(11):4057\u20134065","journal-title":"Afr J Bus Manag"},{"issue":"2","key":"693_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.22456\/2175-2745.25720","volume":"20","author":"WKG Assun\u00e7\u00e3o","year":"2013","unstructured":"Assun\u00e7\u00e3o WKG, Colanzi TE, Vergilio SR, Pozo ATR (2013) Generating integration test orders for aspect oriented software with multi-objective algorithms. Revista de Inform\u00e1tica Te\u00f3rica e Aplicada 20(2):301\u2013327","journal-title":"Revista de Inform\u00e1tica Te\u00f3rica e Aplicada"},{"issue":"1","key":"693_CR3","first-page":"61","volume":"3","author":"E Babaee Tirkolaee","year":"2016","unstructured":"Babaee Tirkolaee E, Alinaghian M, Bakhshi Sasi M, Seyyed Esfahani MM (2016) Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application. J Ind Eng Manag Stud 3(1):61\u201376","journal-title":"J Ind Eng Manag Stud"},{"issue":"02","key":"693_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1142\/S1793005709001428","volume":"5","author":"LT Bui","year":"2009","unstructured":"Bui LT, Barlow M, Abbass HA (2009) A multi-objective risk-based framework for mission capability planning. New Math Nat Comput 5(02):459\u2013485","journal-title":"New Math Nat Comput"},{"issue":"1","key":"693_CR5","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(1):3\u201341","journal-title":"Eur J Oper Res"},{"issue":"5","key":"693_CR6","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1007\/s11390-012-1276-2","volume":"27","author":"WN Chen","year":"2012","unstructured":"Chen WN, Zhang J (2012) Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach. J Comput Sci Technol 27(5):950\u2013965","journal-title":"J Comput Sci Technol"},{"key":"693_CR7","doi-asserted-by":"crossref","unstructured":"Chicano F, Luna F, Nebro AJ, Alba E (2011) Using multi-objective metaheuristics to solve the software project scheduling problem. In: Proceedings of the 13th annual conference on genetic and evolutionary computation. ACM, pp 1915\u20131922","DOI":"10.1145\/2001576.2001833"},{"issue":"3","key":"693_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TEM.2005.850722","volume":"52","author":"SH Cho","year":"2005","unstructured":"Cho SH, Eppinger SD (2005) A simulation-based process model for managing complex design projects. IEEE Trans Eng Manag 52(3):316\u2013328","journal-title":"IEEE Trans Eng Manag"},{"issue":"9","key":"693_CR9","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1057\/palgrave.jors.2600440","volume":"48","author":"N Dayanand","year":"1997","unstructured":"Dayanand N, Padman R (1997) On modelling payments in projects. J Oper Res Soc 48(9):906\u2013918","journal-title":"J Oper Res Soc"},{"issue":"1\u20134","key":"693_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1010910316909","volume":"102","author":"N Dayanand","year":"2001","unstructured":"Dayanand N, Padman R (2001) A two stage search heuristic for scheduling payments in projects. Ann Oper Res 102(1\u20134):197\u2013220","journal-title":"Ann Oper Res"},{"key":"693_CR11","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: PPSN, vol 1917, pp 849\u2013858\u200f","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"2","key":"693_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"693_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1080\/07408170701413944","volume":"40","author":"B Reyck De","year":"2008","unstructured":"De Reyck B, Leus R (2008) R&D project scheduling when activities may fail. IIE Trans 40(4):367\u2013384","journal-title":"IIE Trans"},{"key":"693_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/0-306-48107-3_8","volume-title":"Multiple criteria optimization: state of the art annotated bibliographic surveys","author":"M Ehrgott","year":"2003","unstructured":"Ehrgott M, Gandibleux X (2003) Multi-objective combinatorial optimization\u2014theory, methodology, and applications. In: Gandibleux X (ed) Multiple criteria optimization: state of the art annotated bibliographic surveys. Springer, New York, pp 369\u2013444"},{"issue":"3","key":"693_CR15","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2016.07.024","volume":"256","author":"MJ Geiger","year":"2017","unstructured":"Geiger MJ (2017) A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. Eur J Oper Res 256(3):729\u2013741","journal-title":"Eur J Oper Res"},{"key":"693_CR16","volume-title":"Handbook of metaheuristics","year":"2005","unstructured":"Glover FW, Kochenberger GA (eds) (2005) Handbook of metaheuristics, vol 57. Springer, New York"},{"key":"693_CR17","doi-asserted-by":"publisher","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. Eur J Oper Res 207:1\u201314","journal-title":"Eur J Oper Res"},{"issue":"3","key":"693_CR18","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.ejor.2006.07.053","volume":"189","author":"Z He","year":"2008","unstructured":"He Z, Xu Y (2008) Multi-mode project payment scheduling problems with bonus\u2013penalty structure. Eur J Oper Res 189(3):1191\u20131207","journal-title":"Eur J Oper Res"},{"issue":"3","key":"693_CR19","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ejor.2008.10.005","volume":"198","author":"Z He","year":"2009","unstructured":"He Z, Wang N, Jia T, Xu Y (2009) Simulated annealing and tabu search for multi-mode project payment scheduling. Eur J Oper Res 198(3):688\u2013696","journal-title":"Eur J Oper Res"},{"key":"693_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0377-2217(96)00112-9","volume":"100","author":"W Herroelen","year":"1997","unstructured":"Herroelen W, Van Dommelen P, Demeulemeester E (1997) Project networks with discounted cash flows: a guided tour through recent developments. Eur J Oper Res 100:97\u2013121","journal-title":"Eur J Oper Res"},{"key":"693_CR21","first-page":"15","volume":"15","author":"ZS Hosseini","year":"2014","unstructured":"Hosseini ZS, Pour JH, Roghanian E (2014) A bi-objective pre-emption multi-mode resource-constrained project scheduling problem with due dates in the activities. J Optim Ind Eng 15:15\u201325","journal-title":"J Optim Ind Eng"},{"issue":"8","key":"693_CR22","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/0305-0548(94)90014-0","volume":"21","author":"O Icmeli","year":"1994","unstructured":"Icmeli O, Erenguc SS (1994) A tabu search procedure for the resource-constrained project scheduling problem with discounted cash flows. Comput Oper Res 21(8):841\u2013853","journal-title":"Comput Oper Res"},{"key":"693_CR23","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"},{"issue":"3","key":"693_CR24","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0305-0548(01)00109-5","volume":"30","author":"H Kubotani","year":"2003","unstructured":"Kubotani H, Yoshimura K (2003) Performance evaluation of acceptance probability functions for multi-objective SA. Comput Oper Res 30(3):427\u2013442","journal-title":"Comput Oper Res"},{"key":"693_CR25","unstructured":"K\u00fc\u00e7\u00fcksayac\u0131gil F, Ulusoy G (2018) A hybrid genetic algorithm application for a bi-objective, multi-project, multi-mode, resource-constrained project scheduling problem. Sabanci University. \n                    http:\/\/research.sabanciuniv.edu\/34996\n                    \n                  . Accessed 2 Dec 2018"},{"key":"693_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cie.2015.11.008","volume":"91","author":"P Leyman","year":"2016","unstructured":"Leyman P, Vanhoucke M (2016) Payment models and net present value optimization for resource-constrained project scheduling. Comput Ind Eng 91:139\u2013153","journal-title":"Comput Ind Eng"},{"issue":"6","key":"693_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10916-016-0512-7","volume":"40","author":"S Lu","year":"2016","unstructured":"Lu S, Wang S, Zhang Y (2016) A note on the weight of inverse complexity in improved hybrid genetic algorithm. J Med Syst 40(6):1","journal-title":"J Med Syst"},{"issue":"3","key":"693_CR28","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.ejor.2003.10.053","volume":"164","author":"M Mika","year":"2005","unstructured":"Mika M, Waligora 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. Eur J Oper Res 164(3):639\u2013668","journal-title":"Eur J Oper Res"},{"key":"693_CR29","doi-asserted-by":"crossref","unstructured":"Minku LL, Sudholt D, Yao X (2012) Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design. In: Proceedings of the 14th annual conference on genetic and evolutionary computation. ACM, pp 1221\u20131228\u200f","DOI":"10.1145\/2330163.2330332"},{"issue":"1","key":"693_CR30","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring RH (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32(1):89\u2013120","journal-title":"Oper Res"},{"key":"693_CR31","doi-asserted-by":"publisher","DOI":"10.24200\/sci.2018.20801","author":"E Nabipoor Afruzi","year":"2018","unstructured":"Nabipoor Afruzi E, Aghaie A, Najafi A (2018) Robust optimization for the resource constrained multi-project scheduling problem with uncertain activity durations. Scientia Iranica. \n                    https:\/\/doi.org\/10.24200\/sci.2018.20801","journal-title":"Scientia Iranica"},{"issue":"2","key":"693_CR32","first-page":"87","volume":"2","author":"D Nam","year":"2000","unstructured":"Nam D, Park CH (2000) Multiobjective simulated annealing: a comparative study to evolutionary algorithms. Int J Fuzzy Syst 2(2):87\u201397","journal-title":"Int J Fuzzy Syst"},{"issue":"12","key":"693_CR33","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/S0305-0548(96)00058-5","volume":"24","author":"L \u00d6zdamar","year":"1997","unstructured":"\u00d6zdamar L, D\u00fcndar H (1997) A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows. Comput Oper Res 24(12):1187\u20131200","journal-title":"Comput Oper Res"},{"issue":"9\/10","key":"693_CR34","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1108\/09600039810248181","volume":"28","author":"L \u00d6zdamar","year":"1998","unstructured":"\u00d6zdamar L, Ulusoy G, Bayyigit M (1998) A heuristic treatment of tardiness and net present value criteria in resource-constrained project scheduling. Int J Phys Distrib Logist Manag 28(9\/10):805\u2013824","journal-title":"Int J Phys Distrib Logist Manag"},{"key":"693_CR35","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2017.08.012","volume":"1112","author":"E Oztemel","year":"2017","unstructured":"Oztemel E, Selam AS (2017) Bees algorithm for multi-mode, resource-constrained project scheduling in molding industry. Comput Ind Eng 1112:187\u2013196","journal-title":"Comput Ind Eng"},{"issue":"5","key":"693_CR36","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","volume":"16","author":"AH Russell","year":"1970","unstructured":"Russell AH (1970) Cash flows in networks. Manag Sci 16(5):357\u2013373","journal-title":"Manag Sci"},{"issue":"3","key":"693_CR37","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1080\/0305215X.2016.1197610","volume":"49","author":"MH Sebt","year":"2017","unstructured":"Sebt MH, Afshar MR, Alipour Y (2017) Hybridization of genetic algorithm and fully informed particle swarm for solving the multi-mode resource-constrained project scheduling problem. Eng Optim 49(3):513\u2013530","journal-title":"Eng Optim"},{"issue":"4","key":"693_CR38","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. Int J Eng Trans A Basic 21(4):347\u2013360","journal-title":"Int J Eng Trans A Basic"},{"key":"693_CR39","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01545587","volume":"19","author":"A Sprecher","year":"1997","unstructured":"Sprecher A, Hartmann S, Drexl A (1997) An exact algorithm for project scheduling with multiple modes. OR Spektrum 19:195\u2013203","journal-title":"OR Spektrum"},{"issue":"3","key":"693_CR40","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multi-objective optimization using non-dominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"issue":"4","key":"693_CR41","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1287\/mnsc.1040.0319","volume":"51","author":"JG Szmerekovsky","year":"2005","unstructured":"Szmerekovsky JG (2005) The impact of contractor behavior on the client\u2019s payment-scheduling problem. Manag Sci 51(4):629\u2013640","journal-title":"Manag Sci"},{"issue":"5","key":"693_CR42","first-page":"1","volume":"10","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Hosseinabadi AAR, Soltani M, Sangaiah AK, Wang J (2018) A hybrid genetic algorithm for multi-trip green capacitated arc routing problem in the scope of urban services. Sustainability  (2071\u20131050) 10(5):1\u201321","journal-title":"Sustainability  (2071\u20131050)"},{"key":"693_CR43","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.wasman.2018.03.015","volume":"76","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Mahdavi I, Esfahani MMS (2018) A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew\u2019s working time. Waste Manag 76:138\u2013146","journal-title":"Waste Manag"},{"issue":"2","key":"693_CR44","doi-asserted-by":"publisher","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. Eur J Oper Res 127(2):262\u2013278","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"693_CR45","doi-asserted-by":"publisher","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. Ann Oper Res 102(1\u20134):237\u2013261","journal-title":"Ann Oper Res"},{"issue":"3","key":"693_CR46","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.ejor.2004.07.020","volume":"167","author":"TK Varadharajan","year":"2005","unstructured":"Varadharajan TK, Rajendran C (2005) A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur J Oper Res 167(3):772\u2013795","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"693_CR47","doi-asserted-by":"publisher","first-page":"505","DOI":"10.3233\/FI-2017-1507","volume":"151","author":"S Wang","year":"2017","unstructured":"Wang S, Yang M, Li J, Wu X, Wang H, Liu B, Dong Z, Zhang Y (2017) Texture analysis method based on fractional Fourier entropy and fitness-scaling adaptive genetic algorithm for detecting left-sided and right-sided sensorineural hearing loss. Fundamenta Informaticae 151(1\u20134):505\u2013521","journal-title":"Fundamenta Informaticae"},{"key":"693_CR48","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.knosys.2012.02.003","volume":"31","author":"J Xiong","year":"2012","unstructured":"Xiong J, Yang KW, Liu J, Zhao QS, Chen YW (2012) A two-stage preference-based evolutionary multi-objective approach for capability planning problems. Knowl Based Syst 31:128\u2013139","journal-title":"Knowl Based Syst"},{"issue":"2","key":"693_CR49","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multi-objective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-00693-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-00693-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-00693-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:21:57Z","timestamp":1578356517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-00693-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,7]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["693"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-00693-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,7]]},"assertion":[{"value":"24 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}