Loading…
Reactive scheduling in the multi-mode RCPSP
The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the...
Saved in:
| Published in: | Computers & operations research 2011, Vol.38 (1), p.63-74 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3 |
| container_end_page | 74 |
| container_issue | 1 |
| container_start_page | 63 |
| container_title | Computers & operations research |
| container_volume | 38 |
| creator | Deblaere, Filip Demeulemeester, Erik Herroelen, Willy |
| description | The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the execution of the project, the baseline schedule may become infeasible due to activity duration and resource disruptions. We propose and evaluate a number of dedicated exact reactive scheduling procedures as well as a tabu search heuristic for repairing a disrupted schedule, under the assumption that no activity can be started before its baseline starting time. We report on promising computational results obtained on a set of benchmark problems. |
| doi_str_mv | 10.1016/j.cor.2010.01.001 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_749166295</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S030505481000002X</els_id><sourcerecordid>2126958811</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3</originalsourceid><addsrcrecordid>eNp9kE1Lw0AQhhdRsFZ_gLfgVRJnNsluF09S_ALBUhW8Ldkvu6FN6m5S8N-7pZ6dyzDwPjPDQ8glQoGA7KYtdB8KCmkGLADwiExwxsucs_rzmEyghDqHupqdkrMYW0jFKU7I9dI2evA7m0W9smZc--4r8102rGy2GdeDzze9sdlyvnhbnJMT16yjvfjrU_LxcP8-f8pfXh-f53cvuS7resi5qBUThpWo0FWGNlwJBxWnAktjUAnQDril6FjlFENmuSoFGKWcQEVVOSVXh73b0H-PNg6y7cfQpZOSVwIZo6JOITyEdOhjDNbJbfCbJvxIBLlXIluZlMi9Egkok5LE3B4Ym77feRtk1N522hofrB6k6f0_9C9CYWdX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>749166295</pqid></control><display><type>article</type><title>Reactive scheduling in the multi-mode RCPSP</title><source>Elsevier</source><creator>Deblaere, Filip ; Demeulemeester, Erik ; Herroelen, Willy</creator><creatorcontrib>Deblaere, Filip ; Demeulemeester, Erik ; Herroelen, Willy</creatorcontrib><description>The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the execution of the project, the baseline schedule may become infeasible due to activity duration and resource disruptions. We propose and evaluate a number of dedicated exact reactive scheduling procedures as well as a tabu search heuristic for repairing a disrupted schedule, under the assumption that no activity can be started before its baseline starting time. We report on promising computational results obtained on a set of benchmark problems.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2010.01.001</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Heuristic ; MRCPSP ; Optimization algorithms ; Project management ; Project scheduling ; Reactive scheduling ; Resource management ; Studies</subject><ispartof>Computers & operations research, 2011, Vol.38 (1), p.63-74</ispartof><rights>2010 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Jan 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3</citedby><cites>FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><creatorcontrib>Deblaere, Filip</creatorcontrib><creatorcontrib>Demeulemeester, Erik</creatorcontrib><creatorcontrib>Herroelen, Willy</creatorcontrib><title>Reactive scheduling in the multi-mode RCPSP</title><title>Computers & operations research</title><description>The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the execution of the project, the baseline schedule may become infeasible due to activity duration and resource disruptions. We propose and evaluate a number of dedicated exact reactive scheduling procedures as well as a tabu search heuristic for repairing a disrupted schedule, under the assumption that no activity can be started before its baseline starting time. We report on promising computational results obtained on a set of benchmark problems.</description><subject>Heuristic</subject><subject>MRCPSP</subject><subject>Optimization algorithms</subject><subject>Project management</subject><subject>Project scheduling</subject><subject>Reactive scheduling</subject><subject>Resource management</subject><subject>Studies</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kE1Lw0AQhhdRsFZ_gLfgVRJnNsluF09S_ALBUhW8Ldkvu6FN6m5S8N-7pZ6dyzDwPjPDQ8glQoGA7KYtdB8KCmkGLADwiExwxsucs_rzmEyghDqHupqdkrMYW0jFKU7I9dI2evA7m0W9smZc--4r8102rGy2GdeDzze9sdlyvnhbnJMT16yjvfjrU_LxcP8-f8pfXh-f53cvuS7resi5qBUThpWo0FWGNlwJBxWnAktjUAnQDril6FjlFENmuSoFGKWcQEVVOSVXh73b0H-PNg6y7cfQpZOSVwIZo6JOITyEdOhjDNbJbfCbJvxIBLlXIluZlMi9Egkok5LE3B4Ym77feRtk1N522hofrB6k6f0_9C9CYWdX</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>Deblaere, Filip</creator><creator>Demeulemeester, Erik</creator><creator>Herroelen, Willy</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2011</creationdate><title>Reactive scheduling in the multi-mode RCPSP</title><author>Deblaere, Filip ; Demeulemeester, Erik ; Herroelen, Willy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Heuristic</topic><topic>MRCPSP</topic><topic>Optimization algorithms</topic><topic>Project management</topic><topic>Project scheduling</topic><topic>Reactive scheduling</topic><topic>Resource management</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Deblaere, Filip</creatorcontrib><creatorcontrib>Demeulemeester, Erik</creatorcontrib><creatorcontrib>Herroelen, Willy</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Deblaere, Filip</au><au>Demeulemeester, Erik</au><au>Herroelen, Willy</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reactive scheduling in the multi-mode RCPSP</atitle><jtitle>Computers & operations research</jtitle><date>2011</date><risdate>2011</risdate><volume>38</volume><issue>1</issue><spage>63</spage><epage>74</epage><pages>63-74</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>The multi-mode resource-constrained project scheduling problem (MRCPSP) involves the determination of a baseline schedule of the project activities, which can be executed in multiple modes, satisfying the precedence relations and resource constraints while minimizing the project duration. During the execution of the project, the baseline schedule may become infeasible due to activity duration and resource disruptions. We propose and evaluate a number of dedicated exact reactive scheduling procedures as well as a tabu search heuristic for repairing a disrupted schedule, under the assumption that no activity can be started before its baseline starting time. We report on promising computational results obtained on a set of benchmark problems.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2010.01.001</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2011, Vol.38 (1), p.63-74 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_journals_749166295 |
| source | Elsevier |
| subjects | Heuristic MRCPSP Optimization algorithms Project management Project scheduling Reactive scheduling Resource management Studies |
| title | Reactive scheduling in the multi-mode RCPSP |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T01%3A29%3A39IST&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=Reactive%20scheduling%20in%20the%20multi-mode%20RCPSP&rft.jtitle=Computers%20&%20operations%20research&rft.au=Deblaere,%20Filip&rft.date=2011&rft.volume=38&rft.issue=1&rft.spage=63&rft.epage=74&rft.pages=63-74&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2010.01.001&rft_dat=%3Cproquest_cross%3E2126958811%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c355t-795b69d631b1f4d2a7b9f0472913dd1b90cf07e21f64fb616e7b390dbbf91b2b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=749166295&rft_id=info:pmid/&rfr_iscdi=true |