An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

<!DOCTYPE html>    <html>  <head> <meta charset="utf-8" /> <title>An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation</title>  <link rel="shortcut icon" type="image/ico" href="./data/ijsom/coversheet/favicon.ico" />  <meta name="viewport" content="width=device-width, maximum-scale=1, initial-scale=1, user-scalable=0" />   <meta name="keywords" content="Combinatorial optimization,Multi-mode project scheduling,Resource constraints,Genetic Algorithm,Random key representation" /> <meta name="description" content="In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP." /> <meta name="title" content="An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" /> <meta name="googlebot" content="NOODP" /> <meta name="citation_title" content="An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" /> <meta name="citation_author" content="Sebt, Mohammad Hassan" /> <meta name="citation_author_institution" content="Amirkabir University of Technology, Tehran, Iran" /> <meta name="citation_author" content="Afshar, Mohammad Reza" /> <meta name="citation_author_institution" content="Amirkabir University of Technology, Tehran, Iran" /> <meta name="citation_author" content="Alipouri, Yagub" /> <meta name="citation_author_institution" content="Amirkabir University of Technology, Tehran, Iran" /> <meta name="citation_abstract" content="In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP." /> <meta name="citation_id" content="2545" /> <meta name="citation_publication_date" content="2015/11/01" /> <meta name="citation_date" content="2015-11-01" /> <meta name="citation_journal_title" content="International Journal of Supply and Operations Management" /> <meta name="citation_issn" content="23831359" /> <meta name="citation_volume" content="2" /> <meta name="citation_issue" content="3" /> <meta name="citation_firstpage" content="905" /> <meta name="citation_lastpage" content="924" /> <meta name="citation_publisher" content="Kharazmi University" /> <meta name="citation_doi" content="10.22034/2015.3.06" /> <meta name="DC.Identifier" content="10.22034/2015.3.06" /> <meta name="citation_abstract_html_url" content="http://www.ijsom.com/article_2545.html" /> <meta name="citation_pdf_url" content="http://www.ijsom.com/article_2545_2be1fe07aaa4a2c83667c8cc99613d1b.pdf" /> <meta name="DC.Title" content="An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" /> <meta name="DC.Source" content="International Journal of Supply and Operations Management" /> <meta name="DC.Date" content="01/11/2015" /> <meta name="DC.Date.issued" content="2015-11-01" /> <meta name="DC.Format" content="application/pdf" /> <meta name="DC.Contributor" content="Sebt, Mohammad Hassan" /> <meta name="DC.Contributor" content="Afshar, Mohammad Reza" /> <meta name="DC.Contributor" content="Alipouri, Yagub" /> <meta name="og:title" content="An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" /> <meta name="og:description" content="In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP." /> <meta name="og:url" content="http://www.ijsom.com/article_2545.html" />  <link href="./themes/base/front/assets/css/social-icon-font.css" rel="stylesheet" type="text/css" />  <link href="./themes/base/front/assets/plugins/bootstrap/css/bootstrap.min.css?v=0.02" rel="stylesheet" type="text/css" /> <link href="./themes/old/front/assets/css/header.css?v=0.05" rel="stylesheet" type="text/css" /> <link href="./themes/old/front/assets/css/footer.css" rel="stylesheet" type="text/css" /> <link href="./inc/css/essentials.css?v=0.2" rel="stylesheet" type="text/css" /> <link href="./inc/css/cookieconsent.min.css" rel="stylesheet" type="text/css" /> <link href="./inc/css/print.css" rel="stylesheet" type="text/css" media="print"/>  <link href="./themes/base/front/assets/plugins/bootstrap/css/bootstrap-ltr.min.css" rel="stylesheet" type="text/css" /> <link href=" ./themes/base/front/assets/css/gfonts-OpenSans.css" rel="stylesheet" type="text/css" /> <link href="./themes/old/front/assets/css/accordian.css" rel="stylesheet" type="text/css" /> <link href="./themes/base/front/assets/css/academicons.min.css" rel="stylesheet" type="text/css" />  <meta name="google-site-verification" content="UlbWpwabckk_wTgRmzoJCVPEYKnomtCLcftujpXdou4" /> <link href="./data/ijsom/coversheet/stl_front.css?v=0.99" rel="stylesheet" type="text/css" /> <link href="./data/ijsom/coversheet/stl.css" rel="stylesheet" type="text/css" />  <link rel="alternate" type="application/rss+xml" title="RSS feed" href="ju.rss" /> <script type="text/javascript" src="./themes/base/front/assets/plugins/jquery/jquery.min.js?v=0.5"></script> <script type="text/javascript" src="./inc/js/common.js?v=0.1"></script> <script type="text/javascript" src="./inc/js/jquery/cookieconsent.min.js"></script>   <script src="inc/js/article.js?v=0.31" type="text/javascript" ></script> </head> <body class="ltr len"> <div class="container" id="header"> <div class="row"> <div class="col-xs-12 text-center"> <img src="./data/ijsom/coversheet/head_en.jpg" class="img-responsive text-center" style="display:-webkit-inline-box; width: 100%;" > </div> </div> </div> <div class="container"> <div class="row"> <div class="col-xs-12 col-lg-12 col-md-12 text-center"> <nav class="navbar navbar-default noborder nomargin noradius" role="navigation"> <div class="container-fluid nopadding" > <div class="navbar-header" style="background: #FFFFFF;"> <button type="button" class="navbar-toggle" data-toggle="collapse" data-target="#bs-example-navbar-collapse-1"> <span class="sr-only">Toggle navigation</span> <span class="icon-bar"></span> <span class="icon-bar"></span> <span class="icon-bar"></span> </button>  </div>  <div class="collapse navbar-collapse nopadding" id="bs-example-navbar-collapse-1"> <ul class="nav navbar-nav"> <li><a href="././"> Home</a></li> <li class="dropdown"> <a href="" class="dropdown-toggle" data-toggle="dropdown">Browse <b class="caret"></b></a> <ul class="dropdown-menu"> <li><a href="./?_action=current">Current Issue</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./browse?_action=issue">By Issue</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./browse?_action=author">By Author</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./browse?_action=subject">By Subject</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./author.index">Author Index</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./keyword.index">Keyword Index</a></li> </ul> </li> <li class="dropdown"> <a href="" class="dropdown-toggle" data-toggle="dropdown">Journal Info <b class="caret"></b></a> <ul class="dropdown-menu"> <li><a href="./journal/about">About Journal</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/aim_scope">Aims and Scope</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/editorial.board">Editorial Board</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/process?ethics">Publication Ethics</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/indexing">Indexing and Abstracting</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/links">Related Links</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/faq">FAQ</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/process">Peer Review Process</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./journal/metrics">Journal Metrics</a></li> <li class="divider margin-bottom-6 margin-top-6"></li> <li><a href="./news">News</a></li> </ul> </li> <li><a href="./journal/authors.note"> Guide for Authors</a></li> <li><a href="./author"> Submit Manuscript</a></li> <li><a href="./reviewer?_action=info"> Reviewers</a></li> <li><a href="./journal/contact.us"> Contact Us</a></li> </ul> <ul class="nav navbar-nav navbar-right nomargin"> <li><a href="./contacts">Login</a></li> <li><a href="./contacts?_action=signup">Register</a></li> </ul> </div>  </div>  </nav> </div> </div> </div>  <div class="container" > <div id="dv_main_cnt"> <section class="no-cover-box"> <div class="row">  <div class="col-lg-9 col-md-9 col-sm-8" id="dv_artcl">  <div> <h1 class="margin-bottom-20 size-18 ltr"><span class="article_title bold"> An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation</span></h1> <div> <div class="margin-bottom-3"> </div> <p class="margin-bottom-3">Document Type : Research Paper</p> <p class="padding-0" style="margin:12px -2px 0 -2px"><strong>Authors</strong></p> <ul class="list-inline list-inline-seprator margin-bottom-6 ltr"> <li class="padding-3"> <a href="./?_action=article&au=113652&_au=Mohammad+Hassan++Sebt">Mohammad Hassan Sebt</a> <sup><a href="mailto:sebt@aut.ac.ir" data-toggle="tooltip" data-placement="bottom" title="Email to Corresponding Author"><i class="fa fa-envelope-o" ></i></a></sup> </li> <li class="padding-3"> <a href="./?_action=article&au=113653&_au=Mohammad+Reza++Afshar">Mohammad Reza Afshar</a> </li> <li class="padding-3"> <a href="./?_action=article&au=113654&_au=Yagub++Alipouri">Yagub Alipouri</a> </li> </ul> <p class="margin-bottom-3 ltr" id="aff1"> Amirkabir University of Technology, Tehran, Iran </p> <div class="margin-bottom-3 ltr" id="ar_doi" title="DOI"><i class="ai ai-doi size-25 text-orange"></i> <span dir="ltr"><a href="https://dx.doi.org/10.22034/2015.3.06">10.22034/2015.3.06</a></span></div> <p style="margin:12px -2px 0 -2px"><strong>Abstract</strong></p> <div class="padding_abstract justify ltr">In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP.</div> <p class="padding-0" style="margin:12px -2px 0 -2px"><strong>Keywords</strong></p> <ul class="block list-inline list-inline-seprator margin-bottom-6 ltr"> <li class="padding-3"> <a class="tag_a" href="./?_action=article&kw=104904&_kw=Combinatorial+optimization" >Combinatorial optimization</a> </li> <li class="padding-3"> <a class="tag_a" href="./?_action=article&kw=104905&_kw=Multi-mode+project+scheduling" >Multi-mode project scheduling</a> </li> <li class="padding-3"> <a class="tag_a" href="./?_action=article&kw=104906&_kw=Resource+constraints" >Resource constraints</a> </li> <li class="padding-3"> <a class="tag_a" href="./?_action=article&kw=102135&_kw=Genetic+Algorithm" >Genetic Algorithm</a> </li> <li class="padding-3"> <a class="tag_a" href="./?_action=article&kw=104907&_kw=Random+key+representation" >Random key representation</a> </li> </ul> <p class="padding-0" style="margin:12px -2px 0 -2px"><strong>Main Subjects</strong></p> <ul class="block list-inline list-inline-seprator margin-bottom-6"> <li class="padding-3"> <a href="./?_action=article&sb=158&_sb=operations+planning%2Cscheduling+%26amp%3B+control" >operations planning,scheduling & control</a> </li> </ul> </div> <hr> <div class="page_break"></div> <div class="panel"> <div class="panel-heading card-header"> <h4 class="panel-title "> <a data-toggle="collapse" data-parent="#accordions" href="#collapsesRef"><i class="fa fa-plus"></i> References</a> </h4> </div> <div id="collapsesRef" class="panel-collapse collapse"> <div class="panel-body justify"> <div class="padding-3 margin-top-3 ltr justify">Alcaraz J. Maroto C. and Ruiz, R. (2003). Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Societ, Vol. 54, pp. 614–626. </div> <div class="padding-3 margin-top-3 ltr justify">Anderson E. and Ferris M. (1994). Genetic algorithm for combinatorial optimization: assembly line balancing problem. Operations Research Society of America journal on computing, Vol. 6, pp. 161–173. </div> <div class="padding-3 margin-top-3 ltr justify">Be艧ikci U. Bilge Ü. and Ulusoy, G. (2015). Multi-mode resource constrained multi-project scheduling and resource portfolio problem. European Journal of Operational Research, Vol. 240 (1), pp. 22-31. </div> <div class="padding-3 margin-top-3 ltr justify">Chaleshtari A.S. and Shadokh S. (2014). A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resource with pre-scheduled procurement Arabian Journal of Science Engineering, Vol. 39, pp. 8359- 8369. </div> <div class="padding-3 margin-top-3 ltr justify">Cheng, J. Fowler, J. Kempf, K. and Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research, Vol. 53, pp. 275-287. </div> <div class="padding-3 margin-top-3 ltr justify">Damak N. Jarboui, B. Siarry, P. and Loukil, T. (2009). Differential evolution for solving multi-mode resource constrained project scheduling problems. Computers and Operations Research, Vol. 36, pp. 2653-2659. </div> <div class="padding-3 margin-top-3 ltr justify">Drexl A. and Grünewald J. (1993). Nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions, Vol. 25, pp. 74–81. </div> <div class="padding-3 margin-top-3 ltr justify">Elloumi S. and Fortemps P. (2010). A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 205, pp. 31–41. </div> <div class="padding-3 margin-top-3 ltr justify">Eschelman L., Caruana R. and Schaffer D. (1989). Biases in the Crossover Landscape. Proc. third international conference on genetic algorithms, Morgan Kaufman Publishing, February, pp. 21-29. </div> <div class="padding-3 margin-top-3 ltr justify">Glover F. and Greenberg H.J. (1989). New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research, Vol. 39, pp. 119-130. </div> <div class="padding-3 margin-top-3 ltr justify">Guangqiang Li, G. Zhao F. Guo C. and Teng H. (2006). Parallel Hybrid PSO-GA Algorithm and Its Application to Layout Design. ICNC 2006, Part I, LNCS 4221, pp. 749–758. </div> <div class="padding-3 margin-top-3 ltr justify">Haoa X. Linb L. Gen M. (2014). An Effective Multi-objective EDA for Robust Resource Constrained Project Scheduling with Uncertain Durations. Procedia Computer Science, Vol. 36, pp. 571-578. </div> <div class="padding-3 margin-top-3 ltr justify">Hartmann S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, Vol. 102, pp. 111–135. </div> <div class="padding-3 margin-top-3 ltr justify">Hartmann S. and Briskorn D. (2009). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 207, pp. 1-14. </div> <div class="padding-3 margin-top-3 ltr justify">Hartmann S. and Drexl A. (1998). Project scheduling with multiple modes: A comparison of exact algorithms. Networks, Vol. 32, pp. 283–297. </div> <div class="padding-3 margin-top-3 ltr justify">Hartmann S. and Sprecher A. (1996). A note on `Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, Vol. 94, pp. 377-383. </div> <div class="padding-3 margin-top-3 ltr justify">Jo´zefowska J. Mika M. Rozycki, R. Waligora G. and Weglarz J. (2001). Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research, Vol. 102, pp. 137–155. </div> <div class="padding-3 margin-top-3 ltr justify">Juang C.F. (2004). A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design. IEEE TRANSACTIONS ON SYSTEMS, Vol. 34 (2), pp. 997-1006.  </div> <div class="padding-3 margin-top-3 ltr justify">Kao Y.T. and Zahara E. 2008. “A hybrid genetic algorithm and particle swarm optimization for multimodal functions. Applied Soft Computing, Vol. 8, pp. 849–857.  </div> <div class="padding-3 margin-top-3 ltr justify">Kolisch R. and Drexl A. (1997). Local search for non-preemptive multi-mode resource constrained project scheduling. IIE Transactions, Vol. 29, pp. 987–999.  </div> <div class="padding-3 margin-top-3 ltr justify">Lee K. and El-Sharkawi M. (2008). Modern heuristic optimization techniques.  </div> <div class="padding-3 margin-top-3 ltr justify">Lova, A., Tormos P. and Barber F. (2006). Multi-mode resource constrained project scheduling: Scheduling schemes, priority rules and mode selection rules. Inteligencia Artificial, Vol. 30, pp. 69–86. </div> <div class="padding-3 margin-top-3 ltr justify">Lova A., Tormos P. Cervantes M. and Barber F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, Vol. 117 (2), pp. 302–316. </div> <div class="padding-3 margin-top-3 ltr justify">Marco A. and Stützle T. (2008). Convergence behavior of the fully informed particle swarm optimization algorithm. Proceedings of the 10th annual conference on Genetic and evolutionary computation, January, pp.71-78. </div> <div class="padding-3 margin-top-3 ltr justify">Mendes J., Gonçalves J. and Resende M. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers and Operations Research, Vol. 36, pp. 92–109. </div> <div class="padding-3 margin-top-3 ltr justify">Mendes R., Kennedy J. and Neves J. (2004). The Fully Informed Particle Swarm: Simpler, Maybe Better. IEEE Transactions on Evolutionary Computation:, pp. 204-210. </div> <div class="padding-3 margin-top-3 ltr justify">Montgomery D.C. (2005). Design and analysis of experiments. Arizona, John Wiley & Sons Press. <br />Mori M. and Tseng C. (1997). A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research, Vol. 100, pp. 134–141. </div> <div class="padding-3 margin-top-3 ltr justify">Özdamar L. 1999. A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Vol. 29, pp. 44–59. </div> <div class="padding-3 margin-top-3 ltr justify">Patterson J.H., S艂owinski R. Talbot F. and Weglarz J. (1989). An algorithm for a general class of precedence and resource constrained scheduling problems. Advances in Project Scheduling, pp. 3–28. </div> <div class="padding-3 margin-top-3 ltr justify">Peteghem V.V. and Vanhoucke M. (2009). An artificial immune system for the multi-mode resource-constrained project scheduling problem. In: EvoCOP, Springer. </div> <div class="padding-3 margin-top-3 ltr justify">Peteghem V.V. and Vanhoucke M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 201, pp. 409–418.  </div> <div class="padding-3 margin-top-3 ltr justify">Peteghem V.V. and Vanhoucke M. (2014). An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. European Journal of Operational Research, Vol. 235 (1), pp. 62–72. </div> <div class="padding-3 margin-top-3 ltr justify">Qi J.J. Liu, Y.J. Lei H.T. and Guo B. (2014). Solving the multi-mode resource availability cost problem in project scheduling based on modified particle swarm optimization. Arabian Journal of Science Engineering, Vol. 39, pp. 5279- 5288. </div> <div class="padding-3 margin-top-3 ltr justify">Ranjbar M. Reyck B. and Kianfar F. (2009). “A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research, Vol. 193 (1), pp. 35–48. </div> <div class="padding-3 margin-top-3 ltr justify">Slowinski R. (1980). Two approaches to problems of resource allocation among project activities – A comparative study. Journal of Operational Research Society, Vol. 8, pp. 711–723. </div> <div class="padding-3 margin-top-3 ltr justify">Slowinski R. Soniewicki B. and Weglarz J. (1994). DSS for multi-objective project scheduling. European Journal of Operational Research, Vol. 79, pp. 220–229. </div> <div class="padding-3 margin-top-3 ltr justify">Spears W. and De Jong K. (1991). On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, February, pp. 230–236. </div> <div class="padding-3 margin-top-3 ltr justify">Speranza M.G. and Vercellis C. (1993). Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, Vol. 64, pp. 312-325. </div> <div class="padding-3 margin-top-3 ltr justify">Sprecher A. (1994). Resource-constrained project scheduling: exact methods for the multi-mode case. Lecture Notes in Economics and Mathematical Systems. </div> <div class="padding-3 margin-top-3 ltr justify">Sprecher A. and Drexl A. (1998). Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. European Journal of Operational Research, Vol. 107, pp. 431–450. </div> <div class="padding-3 margin-top-3 ltr justify">Sprecher A. Hartmann S. and Drexl A. (1997). An exact algorithm for project scheduling with multiple modes. OR Spektrum. Organ der Deutschen Gesellschaft fur Operations Research, Vol. 19 (3), pp. 195-203. </div> <div class="padding-3 margin-top-3 ltr justify">Talbot F.B . 198 Management Science, Vol. 28, pp. 1197–1210. </div> <div class="padding-3 margin-top-3 ltr justify">Tseng L.Y. and Chen S.C. (2009). Two-phase genetic local search algorithm for the multi-mode resource-constrained project scheduling problem. IEEE Transactions on Evolutionary Computation, Vol. 13 (4), pp. 848–57. </div> <div class="padding-3 margin-top-3 ltr justify">Wang L. and Fang C. (2011). An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Information Sciences, Vol. 181, pp. 4804–4822. </div> <div class="padding-3 margin-top-3 ltr justify">Wang L. and Fang C. (2012). An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Computers and Operations Research, Vol. 39: 449–460. </div> <div class="padding-3 margin-top-3 ltr justify">Wauters T. Verbeeck K. Berghe G. and De Causmaecker P.(2009). A multi-agent learning approach for the multi-mode resource-constrained project scheduling problem. In: Proceedings of the 8th International Conference on Autonomous Agents and Multi agent Systems, June, pp. 1-8. </div> <div class="padding-3 margin-top-3 ltr justify">Zhang H. (2012). Ant Colony Optimization for Multimode Resource-Constrained Project Scheduling.” American Society of Civil Engineers, Vol. 28, pp. 150-159. </div> <div class="padding-3 margin-top-3 ltr justify">Zhu G., Bard J. and Tu G. (2006). A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. Journal on Computing, Vol. 18 (3), pp. 377–39.</div> </div> </div> </div> </div> </div>   <div class="col-lg-3 col-md-3 col-sm-4"> <div class="panel panel-default my_panel-default margin-bottom-10"> <div class="panel-body ar_info_pnl" id="ar_info_pnl_cover"> <div id="pnl_cover"> <div class="row" > <div class="col-xs-6 col-md-6 nomargin-bottom"> <a href="javascript:loadModal('International Journal of Supply and Operations Management', './data/ijsom/coversheet/cover_en.jpg')"> <img src="data/ijsom/coversheet/cover_en.jpg" alt="International Journal of Supply and Operations Management" style="width: 100%;"> </a> </div> <div class="col-xs-6 col-md-6 nomargin-bottom"> <h6><a href="./issue_460_477.html">Volume 2, Issue 3 - Serial Number 3</a><br/>November 2015<div id="sp_ar_pages">Pages <span dir="ltr">905-924</span></div></h6> </div> </div> </div> </div> </div>  <div class="panel panel-default my_panel-default margin-bottom-10 panel-lists"> <div class="panel-heading"> <h3 class="panel-title"><a data-toggle="collapse" data-parent="#accordion" href="#ar_info_pnl_fl"><i class="fa fa-files-o"></i> Files</a></h3> </div> <div id="ar_info_pnl_fl" class="panel-collapse collapse in"> <div class="panel-body ar_info_pnl padding-6"> <ul class="list-group list-group-bordered list-group-noicon nomargin"> <li class="list-group-item"><a href="./?_action=xml&article=2545" target="_blank" class="tag_a pdf_link"><i class="fa fa-file-code-o text-orange" ></i> XML</a></li> <li class="list-group-item"><a href="./article_2545_2be1fe07aaa4a2c83667c8cc99613d1b.pdf" target="_blank" class="tag_a pdf_link"><i class="fa fa-file-pdf-o text-red" ></i> PDF 1.19 MB</a></li>  </ul> </div> </div> </div> <div class="panel panel-default my_panel-default margin-bottom-10"> <div class="panel-heading"> <h3 class="panel-title"><a data-toggle="collapse" data-parent="#accordion" href="#ar_info_pnl_share"><i class="fa fa-share-square-o" aria-hidden="true"></i> Share</a></h3> </div> <div id="ar_info_pnl_share" class="panel-collapse collapse"> <div class="panel-body ar_info_pnl padding-10 text-center"> <a id="share_facebook" href="https://www.facebook.com/sharer.php?u=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-facebook" data-toggle="tooltip" data-placement="top" title="Facebook"> <i class="icon-facebook"></i> <i class="icon-facebook"></i> </a> <a id="share_linkedin" href="https://www.linkedin.com/shareArticle?mini=true&url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-linkedin" data-toggle="tooltip" data-placement="top" title="Linkedin"> <i class="icon-linkedin"></i> <i class="icon-linkedin"></i> </a> <a id="share_mendeley" href="https://www.mendeley.com/import/?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-youtube" data-toggle="tooltip" data-placement="top" title="Mendeley"> <i class="icon-mendeley"></i> <i class="icon-mendeley"></i> </a> <a id="share_refworks" href="https://www.refworks.com/express/ExpressImport.asp?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-disqus" data-toggle="tooltip" data-placement="top" title="Refworks"> <i class="icon-refworks"><span class="path1"></span><span class="path2"></span><span class="path3"></span><span class="path4"></span><span class="path5"></span><span class="path6"></span><span class="path7"></span><span class="path8"></span><span class="path9"></span><span class="path10"></span></i> <i class="icon-refworks"><span class="path1"></span><span class="path2"></span><span class="path3"></span><span class="path4"></span><span class="path5"></span><span class="path6"></span><span class="path7"></span><span class="path8"></span><span class="path9"></span><span class="path10"></span></i> </a> <a id="share_instagram" href="https://www.instagram.com/?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-instagram" data-toggle="tooltip" data-placement="top" title="Instagram"> <i class="icon-instagram"></i> <i class="icon-instagram"></i> </a> <a id="share_twitter" href="https://twitter.com/share?url=http://www.ijsom.com/article_2545.html&text=An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" target="_blank" class="social-icon social-icon-sm social-twitter" data-toggle="tooltip" data-placement="top" title="Twitter"> <i class="icon-twitter"></i> <i class="icon-twitter"></i> </a> <a id="share_email" href="javascript:act('email')" class="social-icon social-icon-sm social-email3 " data-toggle="tooltip" data-placement="top" title="Email"> <i class="icon-email3"></i> <i class="icon-email3"></i> </a> <a id="share_print" href="javascript:printDiv('dv_artcl')" class="social-icon social-icon-sm social-print" data-toggle="tooltip" data-placement="top" title="Print"> <i class="icon-print"></i> <i class="icon-print"></i> </a> <a id="share_stumble" href="https://mix.com/mixit?su=submit&url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-stumbleupon" data-toggle="tooltip" data-placement="top" title="StumbleUpon"> <i class="icon-stumbleupon"></i> <i class="icon-stumbleupon"></i> </a> <a id="share_acedemia" href="https://www.academia.edu/" target="_blank" class="social-icon social-icon-sm social-academia" data-toggle="tooltip" data-placement="top" title="Academia"> <i class="ai ai-academia"></i> <i class="ai ai-academia"></i> </a> <a id="share_sems" href="https://www.semanticscholar.org/" target="_blank" class="social-icon social-icon-sm social-forrst" data-toggle="tooltip" data-placement="top" title="Semantic scholar"> <i class="ai ai-semantic-scholar"></i> <i class="ai ai-semantic-scholar"></i> </a> <a id="share_reddit" href="https://www.reddit.com/submit?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-dwolla" data-toggle="tooltip" data-placement="top" title="Reddit"> <i class="icon-reddit"></i> <i class="icon-reddit"></i> </a> <a id="share_rg" href="https://www.researchgate.net/" target="_blank" class="social-icon social-icon-sm social-researchgate" data-toggle="tooltip" data-placement="top" title="Research Gate"> <i class="ai ai-researchgate"></i> <i class="ai ai-researchgate"></i> </a> <a id="share_blogger" href="https://www.blogger.com/blog-this.g?u=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-blogger" data-toggle="tooltip" data-placement="top" title="Blogger"> <i class="icon-blogger"></i> <i class="icon-blogger"></i> </a> <a id="share_pinterest" href="https://pinterest.com/pin/create/bookmarklet/?media=&url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-pinterest" data-toggle="tooltip" data-placement="top" title="Pinterest"> <i class="icon-pinterest"></i> <i class="icon-pinterest"></i> </a> <a id="share_digg" href="https://www.digg.com/submit?http://www.ijsom.com/article_2545.html&title=An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation" target="_blank" class="social-icon social-icon-sm social-digg" data-toggle="tooltip" data-placement="top" title="Digg"> <i class="icon-digg"></i> <i class="icon-digg"></i> </a> <a id="share_delicious" href="https://del.icio.us/post?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-delicious" data-toggle="tooltip" data-placement="top" title="Delicious"> <i class="icon-delicious"></i> <i class="icon-delicious"></i> </a> <a id="share_skype" href="https://web.skype.com/share?url=http://www.ijsom.com/article_2545.html" target="_blank" class="social-icon social-icon-sm social-skype" data-toggle="tooltip" data-placement="top" title="Skype"> <i class="icon-skype"></i> <i class="icon-skype"></i> </a> </div> </div> </div>  <div class="panel panel-default my_panel-default margin-bottom-10 panel-lists"> <div class="panel-heading"> <h3 class="panel-title"><a data-toggle="collapse" data-parent="#accordion" href="#ar_info_pnl_cite"><i class=" fa fa-external-link"></i> How to cite</a></h3> </div> <div id="ar_info_pnl_cite" class="panel-collapse collapse "> <div class="panel-body ar_info_pnl"> <ul class="list-group list-group-bordered list-group-noicon" style="display:block !important;max-height:9999px"> <li class="list-group-item ltr"><a class="tag_a" href="./?_action=export&rf=ris&rc=2545">RIS</a></li> <li class="list-group-item ltr"><a class="tag_a" href="./?_action=export&rf=enw&rc=2545">EndNote</a></li> <li class="list-group-item ltr"><a class="tag_a" href="./?_action=export&rf=ris&rc=2545">Mendeley</a></li> <li class="list-group-item ltr"><a class="tag_a" href="./?_action=export&rf=bibtex&rc=2545">BibTeX</a></li> <li class="list-group-item ltr"><a class="tag_a" href="javascript:void(0)" data-toggle="modal" data-target="#cite-apa">APA</a></li> <li class="list-group-item ltr"><a class="tag_a" href="javascript:void(0)" data-toggle="modal" data-target="#cite-mla">MLA</a></li> <li class="list-group-item ltr"><a class="tag_a" href="javascript:void(0)" data-toggle="modal" data-target="#cite-harvard">HARVARD</a></li> <li class="list-group-item ltr"><a class="tag_a" href="javascript:void(0)" data-toggle="modal" data-target="#cite-vancouver">VANCOUVER</a></li> </ul> </div> </div> </div>  <div class="panel panel-default my_panel-default panel-lists"> <div class="panel-heading"> <h3 class="panel-title"><a data-toggle="collapse" data-parent="#accordion" href="#ar_info_pnl_st"><i class="fa fa-bar-chart" aria-hidden="true"></i> Statistics</a></h3> </div> <div id="ar_info_pnl_st" class="panel-collapse collapse in"> <div class="panel-body ar_info_pnl"> <ul class="list-group list-group-bordered list-group-noicon" style="display:block !important;max-height:9999px"> <li class="list-group-item"><a class="tag_a">Article View: <i>3,754</i></a></li> <li class="list-group-item"><a class="tag_a">PDF Download: <i>2,467</i></a></li> </ul> </div> </div> </div> </div>  </div> </section> <div id="cite-apa" class="modal fade" tabindex="-1" role="dialog" aria-labelledby="myModalLabel" aria-hidden="true"> <div class="modal-dialog"> <div class="modal-content">  <div class="modal-header"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> <h4 class="modal-title" id="myModalLabel">APA</h4> </div>  <div class="modal-body"> <p>Sebt, M., Afshar, M., & Alipouri, Y. (2015). An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation. <em>International Journal of Supply and Operations Management</em>, 2(3), 905-924. doi: 10.22034/2015.3.06</p> </div> </div> </div> </div> <div id="cite-mla" class="modal fade" tabindex="-1" role="dialog" aria-labelledby="myModalLabel" aria-hidden="true"> <div class="modal-dialog"> <div class="modal-content">  <div class="modal-header"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> <h4 class="modal-title" id="myModalLabel">MLA</h4> </div>  <div class="modal-body"> <p>Mohammad Hassan Sebt; Mohammad Reza Afshar; Yagub Alipouri. "An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation". <em>International Journal of Supply and Operations Management</em>, 2, 3, 2015, 905-924. doi: 10.22034/2015.3.06</p> </div> </div> </div> </div> <div id="cite-harvard" class="modal fade" tabindex="-1" role="dialog" aria-labelledby="myModalLabel" aria-hidden="true"> <div class="modal-dialog"> <div class="modal-content">  <div class="modal-header"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> <h4 class="modal-title" id="myModalLabel">HARVARD</h4> </div>  <div class="modal-body"> <p>Sebt, M., Afshar, M., Alipouri, Y. (2015). 'An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation', <em>International Journal of Supply and Operations Management</em>, 2(3), pp. 905-924. doi: 10.22034/2015.3.06</p> </div> </div> </div> </div> <div id="cite-vancouver" class="modal fade" tabindex="-1" role="dialog" aria-labelledby="myModalLabel" aria-hidden="true"> <div class="modal-dialog"> <div class="modal-content">  <div class="modal-header"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> <h4 class="modal-title" id="myModalLabel">VANCOUVER</h4> </div>  <div class="modal-body"> <p>Sebt, M., Afshar, M., Alipouri, Y. An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation. <em>International Journal of Supply and Operations Management</em>, 2015; 2(3): 905-924. doi: 10.22034/2015.3.06</p> </div> </div> </div> </div> </div> </div>   <section class="alternate padding-xxs"> </section>   <div class="container"> <footer id="footer"> <div class="scrollup" id="scroll" href="#"><span></span></div> <div class="row"> <div class="col-md-2">  <h4 class="">Explore Journal</h4> <ul class="footer-links list-unstyled"> <li id="fli_home"><a href="./">Home</a></li> <li id="fli_about"><a href="./journal/about">About Journal</a></li> <li id="fli_Edb"><a href="./journal/editorial.board">Editorial Board</a></li> <li id="fli_submit"><a href="./author">Submit Manuscript</a></li> <li id="fli_contactus"><a href="./journal/contact.us">Contact Us</a></li> <li id="fli_glossary"><a href="./journal/glossary">Glossary</a></li> <li id="fli_order_hrdj"><a href="./journal/subscription.form">Hard Copy Subscription</a></li> <li id="fli_sitemap"><a href="./sitemap.xml?usr">Sitemap</a></li> </ul>  </div> <div class="col-md-3">  <h4 class="">Latest News</h4> <ul class="footer-posts list-unstyled"> <li> <a href="./news?newsCode=173">SD of ISC: Sustainable Development of Intelligent Supply Chains based on Trends and Future Directions: Application of Novel Solution Techniques</a> <small class="ltr">2023-03-05</small> </li> </ul>  </div> <div class="col-md-3">  <div><p><a title="Linkedin" href="http://www.linkedin.com/company/ijsom?trk=eml-cp_mktg-btn-welcome-20120607%2F"><img src="images/linkedin.jpg" alt="linkedin" /></a></p></div>  </div> <div class="col-md-4">  <h4 class="">Newsletter Subscription</h4> <p>Subscribe to the journal newsletter and receive the latest news and updates</p> <form class="validate" action="" method="post" data-success="Subscription saved successfully." data-toastr-position="bottom-right"> <input type="hidden" name="_token" value="4fd25acd389604e4c1ae0d8b93a4f9df6ffb9ec28378b747"/> <div class="input-group"> <span class="input-group-addon"><i class="fa fa-envelope"></i></span> <input type="email" id="email" name="email" required="required" class="form-control required sbs_email" placeholder="Enter your Email" oninvalid="this.setCustomValidity('Enter a valid email address.')" oninput="this.setCustomValidity('')"> <span class="input-group-btn"> <button class="btn btn-primary mybtn" type="submit">Subscribe</button> </span> </div> </form>   <div class="margin-top-20"> <a class="noborder" href="" target="_blank" class="social-icon social-icon-border social-facebook pull-left block" data-toggle="tooltip" data-placement="top" title="Facebook"> <i class="fa fa-facebook-square" aria-hidden="true"></i> </a> <a class="noborder" href="" target="_blank" class="social-icon social-icon-border social-facebook pull-left block" data-toggle="tooltip" data-placement="top" title="Twitter"> <i class="fa fa-twitter-square" aria-hidden="true"></i> </a> <a class="noborder" href="" target="_blank" class="social-icon social-icon-border social-facebook pull-left block" data-toggle="tooltip" data-placement="top" title="Linkedin"> <i class="fa fa-linkedin-square" aria-hidden="true"></i> </a> <a class="noborder" href="./ju.rss" class="social-icon social-icon-border social-rss pull-left block" data-toggle="tooltip" data-placement="top" title="Rss"><i class="fa fa-rss-square" aria-hidden="true"></i></a> </div> </div> </div> <div class="copyright" style="position: relative"> <ul class="nomargin list-inline mobile-block"> <li>© Journal Management System. <span id='sp_crt'>Powered by <a target='_blank' href='https://www.sinaweb.net/'>Sinaweb</a></span></li> </ul> </div> </footer> </div>  </div>   <a href="#" id="toTop_old"></a>  <div id="preloader"> <div class="inner"> <span class="loader"></span> </div> </div>  <script type="text/javascript">var plugin_path = './themes/base/front/assets/plugins/';</script> <script type="text/javascript" src="./themes/base/front/assets/js/scripts.js?v=0.02"></script>   <script type="text/javascript"> $('ul.nav li.dropdown').hover(function() { if (window.matchMedia('(max-width: 767px)').matches) return; $(this).find('.dropdown-menu').stop(true, true).delay(200).fadeIn(500); }, function() { if (window.matchMedia('(max-width: 767px)').matches) return; $(this).find('.dropdown-menu').stop(true, true).delay(200).fadeOut(500); }); var btn = $('#toTop_old'); $(window).scroll(function() { if ($(window).scrollTop() > 300) { btn.addClass('show'); } else { btn.removeClass('show'); } }); btn.on('click', function(e) { e.preventDefault(); $('html, body').animate({scrollTop:0}, '300'); }); window.cookieconsent.initialise({ "palette": { "popup": { "background": "#222" }, "button": { "background": "#f1d600" } }, "content": { "message": "This website uses cookies to ensure you get the best experience on our website.", "dismiss": "Got it!", "link": "" } }); </script> </body> </html><div id="actn_modal" class="modal fade" tabindex="-1"> <div id="" class="modal-dialog modal-dialog madal-aw"> <div class="modal-content"> <div class="modal-header"> <button type="button" class="close pull-right" data-dismiss="modal" aria-hidden="true" href="#lost">×</button> <h5 class="modal-title"></h5> </div> <div class="modal-body"></div> <div class="modal-footer"></div> </div> </div> </div>

CINXE.COM

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation