Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows
In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resourc...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 32 |
|---|---|
| container_issue | |
| container_start_page | 27 |
| container_title | |
| container_volume | |
| creator | Mika, M. Rozycki, R. Waligora, G. |
| description | In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. Applications of two local search metaheuristics - simulated annealing and tabu search are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given. |
| doi_str_mv | 10.1109/MMAR.2011.6031310 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6031310</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6031310</ieee_id><sourcerecordid>6031310</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-8a8ebdd44857d717ec964b915a04f592b6bae3dd99e3805561647f4514e2e0153</originalsourceid><addsrcrecordid>eNo1kM9KAzEYxCMiqLUPIF7yAlvzbZLN5liKWqFFED2XbPKtm7K7KUmW4tv7r85lmB_MHIaQW2ALAKbvt9vl66JkAIuKceDAzsg1CKkU0yDUOZlrVf_nsr4k85T27FtVpTVnVyRsgjU9TWii7eiA2XQ4RZ-yt4m2IdIUBqTOJxsxY2HDmP04hSnRQwx7tJkm26Gbej9-_KCmxyHRo8_dbylMY0ZHrUkdbftwTDfkojV9wvnJZ-T98eFttS42L0_Pq-Wm8KBkLmpTY-OcELVUToFCqyvRaJCGiVbqsqkag9w5rZHXTMoKKqFaIUFgiQwkn5G7v12PiLtD9IOJn7vTR_wLiVtcww</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Mika, M. ; Rozycki, R. ; Waligora, G.</creator><creatorcontrib>Mika, M. ; Rozycki, R. ; Waligora, G.</creatorcontrib><description>In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. Applications of two local search metaheuristics - simulated annealing and tabu search are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.</description><identifier>ISBN: 9781457709128</identifier><identifier>ISBN: 1457709120</identifier><identifier>EISBN: 1457709147</identifier><identifier>EISBN: 9781457709135</identifier><identifier>EISBN: 9781457709142</identifier><identifier>EISBN: 1457709139</identifier><identifier>DOI: 10.1109/MMAR.2011.6031310</identifier><language>eng</language><publisher>IEEE</publisher><subject>Markov processes ; Mathematical programming ; Processor scheduling ; Resource management ; Schedules ; Simulated annealing ; Synthetic aperture sonar</subject><ispartof>2011 16th International Conference on Methods & Models in Automation & Robotics, 2011, p.27-32</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6031310$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6031310$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mika, M.</creatorcontrib><creatorcontrib>Rozycki, R.</creatorcontrib><creatorcontrib>Waligora, G.</creatorcontrib><title>Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows</title><title>2011 16th International Conference on Methods & Models in Automation & Robotics</title><addtitle>MMAR</addtitle><description>In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. Applications of two local search metaheuristics - simulated annealing and tabu search are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.</description><subject>Markov processes</subject><subject>Mathematical programming</subject><subject>Processor scheduling</subject><subject>Resource management</subject><subject>Schedules</subject><subject>Simulated annealing</subject><subject>Synthetic aperture sonar</subject><isbn>9781457709128</isbn><isbn>1457709120</isbn><isbn>1457709147</isbn><isbn>9781457709135</isbn><isbn>9781457709142</isbn><isbn>1457709139</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kM9KAzEYxCMiqLUPIF7yAlvzbZLN5liKWqFFED2XbPKtm7K7KUmW4tv7r85lmB_MHIaQW2ALAKbvt9vl66JkAIuKceDAzsg1CKkU0yDUOZlrVf_nsr4k85T27FtVpTVnVyRsgjU9TWii7eiA2XQ4RZ-yt4m2IdIUBqTOJxsxY2HDmP04hSnRQwx7tJkm26Gbej9-_KCmxyHRo8_dbylMY0ZHrUkdbftwTDfkojV9wvnJZ-T98eFttS42L0_Pq-Wm8KBkLmpTY-OcELVUToFCqyvRaJCGiVbqsqkag9w5rZHXTMoKKqFaIUFgiQwkn5G7v12PiLtD9IOJn7vTR_wLiVtcww</recordid><startdate>201108</startdate><enddate>201108</enddate><creator>Mika, M.</creator><creator>Rozycki, R.</creator><creator>Waligora, G.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201108</creationdate><title>Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows</title><author>Mika, M. ; Rozycki, R. ; Waligora, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-8a8ebdd44857d717ec964b915a04f592b6bae3dd99e3805561647f4514e2e0153</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Markov processes</topic><topic>Mathematical programming</topic><topic>Processor scheduling</topic><topic>Resource management</topic><topic>Schedules</topic><topic>Simulated annealing</topic><topic>Synthetic aperture sonar</topic><toplevel>online_resources</toplevel><creatorcontrib>Mika, M.</creatorcontrib><creatorcontrib>Rozycki, R.</creatorcontrib><creatorcontrib>Waligora, G.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mika, M.</au><au>Rozycki, R.</au><au>Waligora, G.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows</atitle><btitle>2011 16th International Conference on Methods & Models in Automation & Robotics</btitle><stitle>MMAR</stitle><date>2011-08</date><risdate>2011</risdate><spage>27</spage><epage>32</epage><pages>27-32</pages><isbn>9781457709128</isbn><isbn>1457709120</isbn><eisbn>1457709147</eisbn><eisbn>9781457709135</eisbn><eisbn>9781457709142</eisbn><eisbn>1457709139</eisbn><abstract>In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. Applications of two local search metaheuristics - simulated annealing and tabu search are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.</abstract><pub>IEEE</pub><doi>10.1109/MMAR.2011.6031310</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781457709128 |
| ispartof | 2011 16th International Conference on Methods & Models in Automation & Robotics, 2011, p.27-32 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6031310 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Markov processes Mathematical programming Processor scheduling Resource management Schedules Simulated annealing Synthetic aperture sonar |
| title | Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T17%3A07%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Local%20search%20metaheuristics%20for%20some%20discrete-continuous%20project%20scheduling%20problems%20with%20discounted%20cash%20flows&rft.btitle=2011%2016th%20International%20Conference%20on%20Methods%20&%20Models%20in%20Automation%20&%20Robotics&rft.au=Mika,%20M.&rft.date=2011-08&rft.spage=27&rft.epage=32&rft.pages=27-32&rft.isbn=9781457709128&rft.isbn_list=1457709120&rft_id=info:doi/10.1109/MMAR.2011.6031310&rft_dat=%3Cieee_6IE%3E6031310%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457709147&rft.eisbn_list=9781457709135&rft.eisbn_list=9781457709142&rft.eisbn_list=1457709139&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6031310&rfr_iscdi=true |