A genetic algorithm for the resource constrained multi-project scheduling problem
This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, an...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2008-09, Vol.189 (3), p.1171-1190 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1190 |
|---|---|
| container_issue | 3 |
| container_start_page | 1171 |
| container_title | European journal of operational research |
| container_volume | 189 |
| creator | Gonçalves, J.F. Mendes, J.J.M. Resende, M.G.C. |
| description | This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm. |
| doi_str_mv | 10.1016/j.ejor.2006.06.074 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204143461</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221707005929</els_id><sourcerecordid>1453019511</sourcerecordid><originalsourceid>FETCH-LOGICAL-c545t-51c68a7a09879beab5fffe8e236d9deffd8d87a6de24cc35fc75444b03475c1a3</originalsourceid><addsrcrecordid>eNp9UE2LHCEQlZBAJpv8gZwk955Y3drakMuy5At2WQLJWRwtZ2z6Y6LOwv77VDMhx0g9C_S9V8Vj7D2IPQjoP457HNe8b4Xo91tp-YLtwOi26U0vXrKd6LRu2hb0a_amlFEIAQrUjv245UdcsCbP3XRcc6qnmcc183pCnrGsl-yR-3UpNbu0YODzZaqpOed1RF958ScMlyktR05Phwnnt-xVdFPBd3_7Dfv15fPPu2_N_ePX73e3941XUtVGge-N004MRg8HdAcVY0SDbdeHIWCMwQSjXR-wld53KnqtpJQH0UmtPLjuhn24-tLc3xcs1Y607EIjbSskyE72QKT2SvJ5LSVjtOecZpefLQi7JWdHuyVnt-TsVlqS6OEqynhG_0-BdIiKxT7ZzoEZ6H4mkNRQS4SOcN4-QYMFGIQ91Zn8Pl39kOJ4Spht8QkXjyFlytCGNf1vnT9bApK2</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204143461</pqid></control><display><type>article</type><title>A genetic algorithm for the resource constrained multi-project scheduling problem</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Gonçalves, J.F. ; Mendes, J.J.M. ; Resende, M.G.C.</creator><creatorcontrib>Gonçalves, J.F. ; Mendes, J.J.M. ; Resende, M.G.C.</creatorcontrib><description>This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2006.06.074</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Genetic algorithm ; Genetic algorithms ; Heuristic ; Metaheuristics ; Project management ; Scheduling ; Studies</subject><ispartof>European journal of operational research, 2008-09, Vol.189 (3), p.1171-1190</ispartof><rights>2007</rights><rights>Copyright Elsevier Sequoia S.A. Sep 16, 2008</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c545t-51c68a7a09879beab5fffe8e236d9deffd8d87a6de24cc35fc75444b03475c1a3</citedby><cites>FETCH-LOGICAL-c545t-51c68a7a09879beab5fffe8e236d9deffd8d87a6de24cc35fc75444b03475c1a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221707005929$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a189_3ay_3a2008_3ai_3a3_3ap_3a1171-1190.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Gonçalves, J.F.</creatorcontrib><creatorcontrib>Mendes, J.J.M.</creatorcontrib><creatorcontrib>Resende, M.G.C.</creatorcontrib><title>A genetic algorithm for the resource constrained multi-project scheduling problem</title><title>European journal of operational research</title><description>This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.</description><subject>Genetic algorithm</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Metaheuristics</subject><subject>Project management</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UE2LHCEQlZBAJpv8gZwk955Y3drakMuy5At2WQLJWRwtZ2z6Y6LOwv77VDMhx0g9C_S9V8Vj7D2IPQjoP457HNe8b4Xo91tp-YLtwOi26U0vXrKd6LRu2hb0a_amlFEIAQrUjv245UdcsCbP3XRcc6qnmcc183pCnrGsl-yR-3UpNbu0YODzZaqpOed1RF958ScMlyktR05Phwnnt-xVdFPBd3_7Dfv15fPPu2_N_ePX73e3941XUtVGge-N004MRg8HdAcVY0SDbdeHIWCMwQSjXR-wld53KnqtpJQH0UmtPLjuhn24-tLc3xcs1Y607EIjbSskyE72QKT2SvJ5LSVjtOecZpefLQi7JWdHuyVnt-TsVlqS6OEqynhG_0-BdIiKxT7ZzoEZ6H4mkNRQS4SOcN4-QYMFGIQ91Zn8Pl39kOJ4Spht8QkXjyFlytCGNf1vnT9bApK2</recordid><startdate>20080916</startdate><enddate>20080916</enddate><creator>Gonçalves, J.F.</creator><creator>Mendes, J.J.M.</creator><creator>Resende, M.G.C.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080916</creationdate><title>A genetic algorithm for the resource constrained multi-project scheduling problem</title><author>Gonçalves, J.F. ; Mendes, J.J.M. ; Resende, M.G.C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c545t-51c68a7a09879beab5fffe8e236d9deffd8d87a6de24cc35fc75444b03475c1a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Genetic algorithm</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Metaheuristics</topic><topic>Project management</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gonçalves, J.F.</creatorcontrib><creatorcontrib>Mendes, J.J.M.</creatorcontrib><creatorcontrib>Resende, M.G.C.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gonçalves, J.F.</au><au>Mendes, J.J.M.</au><au>Resende, M.G.C.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A genetic algorithm for the resource constrained multi-project scheduling problem</atitle><jtitle>European journal of operational research</jtitle><date>2008-09-16</date><risdate>2008</risdate><volume>189</volume><issue>3</issue><spage>1171</spage><epage>1190</epage><pages>1171-1190</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2006.06.074</doi><tpages>20</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2008-09, Vol.189 (3), p.1171-1190 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204143461 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Genetic algorithm Genetic algorithms Heuristic Metaheuristics Project management Scheduling Studies |
| title | A genetic algorithm for the resource constrained multi-project scheduling problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T00%3A23%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20genetic%20algorithm%20for%20the%20resource%20constrained%20multi-project%20scheduling%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Gon%C3%A7alves,%20J.F.&rft.date=2008-09-16&rft.volume=189&rft.issue=3&rft.spage=1171&rft.epage=1190&rft.pages=1171-1190&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2006.06.074&rft_dat=%3Cproquest_cross%3E1453019511%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204143461&rft_id=info:pmid/&rft_els_id=S0377221707005929&rfr_iscdi=true |