A branch and bound algorithm for the resource-constrained project scheduling problem
A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1998-06, Vol.107 (2), p.272-288 |
|---|---|
| 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 | 288 |
|---|---|
| container_issue | 2 |
| container_start_page | 272 |
| container_title | European journal of operational research |
| container_volume | 107 |
| creator | Brucker, Peter Knust, Sigrid Schoo, Arno Thiele, Olaf |
| description | A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are
n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish–start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The branching scheme starts from a graph representing a set of conjunctions (the classical finish–start precedence constraints) and disjunctions (induced by the resource constraints). Then it either introduces disjunctive constraints between pairs of activities or places these activities in parallel. Concepts of immediate selection are developed in connection with this branching scheme. Immediate Selection allows to add conjunctions as well as further disjunctions and parallelity relations. Computational results based on the test data of Kolisch et al. (Kolisch, R., Sprecher, A., Drexl, A., 1995. Management Science 41, 1693–1703.) and Kolisch and Sprecher (Kolisch, R., Sprecher, A., 1997. PSPLIB – A project scheduling problem library, EJOR 96, pp. 205–216.) are reported. |
| doi_str_mv | 10.1016/S0377-2217(97)00335-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204144272</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221797003354</els_id><sourcerecordid>37997479</sourcerecordid><originalsourceid>FETCH-LOGICAL-c549t-126370cd34b216d347577608e9099c1292e08e437cb4c64cb401b9f572ce69103</originalsourceid><addsrcrecordid>eNqFkE1r3DAQhkVpodu0P6FgSg_twc3ow5Z0KiGkHySQQ9OzkOVxrMVrbSVvIP8-42zYawUzryTe-eBh7COHbxx4e_4HpNa1EFx_sforgJRNrV6xDTda1K1p4TXbnCxv2btStgDAG95s2N1F1WU_h7Hyc1916UDZT_cpx2XcVUPK1TJilbGkQw5YhzSXJfs4Y1_tc9piWKoSRuwPU5zv169uwt179mbwU8EPL3rG_v64urv8Vd_c_vx9eXFTh0bZpeailRpCL1UneEuiG61bMGjB2sCFFUgPJXXoVGgVZeCdHRotAraWgzxjn459ae6_A5bFbWnNmUY6AYorJbQgU3M0hZxKyTi4fY47nx8dB7fyc8_83ArHWe2e-TlFddfHuox7DKcipLNNBMQ9OOk5aMqP681aQxIpBMV-VS2cMMaNy466fX5Z1Zfgp2FlHsupq5DGGGXJ9v1oQ8L2EDG7EiLOAfuYibXrU_zP2k9BHpxw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204144272</pqid></control><display><type>article</type><title>A branch and bound algorithm for the resource-constrained project scheduling problem</title><source>RePEc</source><source>Access via ScienceDirect (Elsevier)</source><creator>Brucker, Peter ; Knust, Sigrid ; Schoo, Arno ; Thiele, Olaf</creator><creatorcontrib>Brucker, Peter ; Knust, Sigrid ; Schoo, Arno ; Thiele, Olaf</creatorcontrib><description>A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are
n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish–start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The branching scheme starts from a graph representing a set of conjunctions (the classical finish–start precedence constraints) and disjunctions (induced by the resource constraints). Then it either introduces disjunctive constraints between pairs of activities or places these activities in parallel. Concepts of immediate selection are developed in connection with this branching scheme. Immediate Selection allows to add conjunctions as well as further disjunctions and parallelity relations. Computational results based on the test data of Kolisch et al. (Kolisch, R., Sprecher, A., Drexl, A., 1995. Management Science 41, 1693–1703.) and Kolisch and Sprecher (Kolisch, R., Sprecher, A., 1997. PSPLIB – A project scheduling problem library, EJOR 96, pp. 205–216.) are reported.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(97)00335-4</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Branch and bound method ; Disjunctive graph model ; Exact sciences and technology ; Immediate selection ; Job shops ; Operational research and scientific management ; Operational research. Management science ; Project management ; Resource-constrained project scheduling problem ; Scheduling ; Scheduling, sequencing ; Studies</subject><ispartof>European journal of operational research, 1998-06, Vol.107 (2), p.272-288</ispartof><rights>1998 Elsevier Science B.V.</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jun 1, 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c549t-126370cd34b216d347577608e9099c1292e08e437cb4c64cb401b9f572ce69103</citedby><cites>FETCH-LOGICAL-c549t-126370cd34b216d347577608e9099c1292e08e437cb4c64cb401b9f572ce69103</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(97)00335-4$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,3550,4008,23930,23931,25140,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2388849$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a107_3ay_3a1998_3ai_3a2_3ap_3a272-288.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Brucker, Peter</creatorcontrib><creatorcontrib>Knust, Sigrid</creatorcontrib><creatorcontrib>Schoo, Arno</creatorcontrib><creatorcontrib>Thiele, Olaf</creatorcontrib><title>A branch and bound algorithm for the resource-constrained project scheduling problem</title><title>European journal of operational research</title><description>A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are
n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish–start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The branching scheme starts from a graph representing a set of conjunctions (the classical finish–start precedence constraints) and disjunctions (induced by the resource constraints). Then it either introduces disjunctive constraints between pairs of activities or places these activities in parallel. Concepts of immediate selection are developed in connection with this branching scheme. Immediate Selection allows to add conjunctions as well as further disjunctions and parallelity relations. Computational results based on the test data of Kolisch et al. (Kolisch, R., Sprecher, A., Drexl, A., 1995. Management Science 41, 1693–1703.) and Kolisch and Sprecher (Kolisch, R., Sprecher, A., 1997. PSPLIB – A project scheduling problem library, EJOR 96, pp. 205–216.) are reported.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Branch and bound method</subject><subject>Disjunctive graph model</subject><subject>Exact sciences and technology</subject><subject>Immediate selection</subject><subject>Job shops</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Project management</subject><subject>Resource-constrained project scheduling problem</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkE1r3DAQhkVpodu0P6FgSg_twc3ow5Z0KiGkHySQQ9OzkOVxrMVrbSVvIP8-42zYawUzryTe-eBh7COHbxx4e_4HpNa1EFx_sforgJRNrV6xDTda1K1p4TXbnCxv2btStgDAG95s2N1F1WU_h7Hyc1916UDZT_cpx2XcVUPK1TJilbGkQw5YhzSXJfs4Y1_tc9piWKoSRuwPU5zv169uwt179mbwU8EPL3rG_v64urv8Vd_c_vx9eXFTh0bZpeailRpCL1UneEuiG61bMGjB2sCFFUgPJXXoVGgVZeCdHRotAraWgzxjn459ae6_A5bFbWnNmUY6AYorJbQgU3M0hZxKyTi4fY47nx8dB7fyc8_83ArHWe2e-TlFddfHuox7DKcipLNNBMQ9OOk5aMqP681aQxIpBMV-VS2cMMaNy466fX5Z1Zfgp2FlHsupq5DGGGXJ9v1oQ8L2EDG7EiLOAfuYibXrU_zP2k9BHpxw</recordid><startdate>19980601</startdate><enddate>19980601</enddate><creator>Brucker, Peter</creator><creator>Knust, Sigrid</creator><creator>Schoo, Arno</creator><creator>Thiele, Olaf</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><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>19980601</creationdate><title>A branch and bound algorithm for the resource-constrained project scheduling problem</title><author>Brucker, Peter ; Knust, Sigrid ; Schoo, Arno ; Thiele, Olaf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c549t-126370cd34b216d347577608e9099c1292e08e437cb4c64cb401b9f572ce69103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Branch and bound method</topic><topic>Disjunctive graph model</topic><topic>Exact sciences and technology</topic><topic>Immediate selection</topic><topic>Job shops</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Project management</topic><topic>Resource-constrained project scheduling problem</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brucker, Peter</creatorcontrib><creatorcontrib>Knust, Sigrid</creatorcontrib><creatorcontrib>Schoo, Arno</creatorcontrib><creatorcontrib>Thiele, Olaf</creatorcontrib><collection>Pascal-Francis</collection><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>Brucker, Peter</au><au>Knust, Sigrid</au><au>Schoo, Arno</au><au>Thiele, Olaf</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A branch and bound algorithm for the resource-constrained project scheduling problem</atitle><jtitle>European journal of operational research</jtitle><date>1998-06-01</date><risdate>1998</risdate><volume>107</volume><issue>2</issue><spage>272</spage><epage>288</epage><pages>272-288</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are
n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacity of each resource type is limited. Furthermore, finish–start precedence relations between the activities are given. The objective is to determine a schedule with minimal makespan. The branching scheme starts from a graph representing a set of conjunctions (the classical finish–start precedence constraints) and disjunctions (induced by the resource constraints). Then it either introduces disjunctive constraints between pairs of activities or places these activities in parallel. Concepts of immediate selection are developed in connection with this branching scheme. Immediate Selection allows to add conjunctions as well as further disjunctions and parallelity relations. Computational results based on the test data of Kolisch et al. (Kolisch, R., Sprecher, A., Drexl, A., 1995. Management Science 41, 1693–1703.) and Kolisch and Sprecher (Kolisch, R., Sprecher, A., 1997. PSPLIB – A project scheduling problem library, EJOR 96, pp. 205–216.) are reported.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(97)00335-4</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1998-06, Vol.107 (2), p.272-288 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204144272 |
| source | RePEc; Access via ScienceDirect (Elsevier) |
| subjects | Algorithms Applied sciences Branch and bound method Disjunctive graph model Exact sciences and technology Immediate selection Job shops Operational research and scientific management Operational research. Management science Project management Resource-constrained project scheduling problem Scheduling Scheduling, sequencing Studies |
| title | A branch and bound algorithm for the resource-constrained 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=2024-12-26T19%3A45%3A17IST&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%20branch%20and%20bound%20algorithm%20for%20the%20resource-constrained%20project%20scheduling%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Brucker,%20Peter&rft.date=1998-06-01&rft.volume=107&rft.issue=2&rft.spage=272&rft.epage=288&rft.pages=272-288&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(97)00335-4&rft_dat=%3Cproquest_cross%3E37997479%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=204144272&rft_id=info:pmid/&rft_els_id=S0377221797003354&rfr_iscdi=true |