Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources
The Event Scheduling Problem with Consumption and Production of Resources (ESPCPR) is a general scheduling problem where the availability of a resource is depleted and replenished at the occurrence times of a set of events. This problem is an extension of the Resource Constrained Project Scheduling...
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics 2018-01, Vol.234, p.178-194 |
|---|---|
| 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 | 194 |
|---|---|
| container_issue | |
| container_start_page | 178 |
| container_title | Discrete Applied Mathematics |
| container_volume | 234 |
| creator | Carlier, J. Moukrim, A. Sahli, A. |
| description | The Event Scheduling Problem with Consumption and Production of Resources (ESPCPR) is a general scheduling problem where the availability of a resource is depleted and replenished at the occurrence times of a set of events. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where activities are replaced by events, which have to be scheduled subject to generalized precedence relations. The aim of this paper is to show the connections between ESPCPR and classical scheduling problems in order to bring new lower bounds for ESPCPR. We start by recalling some similar models in literature such as the Project Scheduling with Inventory Constraints and the Financing Problem. Subsequently, we describe how to model classical scheduling problems using ESPCPR. Finally, we propose four lower bounds for this problem. The obtained computational results confirm their effectiveness. |
| doi_str_mv | 10.1016/j.dam.2016.05.021 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01318852v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X16302463</els_id><sourcerecordid>2009163478</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-f0e7f345c0e9d0e017aa560bfc4395858e040d0cc1f7fa839fbf2fc19d1cfa173</originalsourceid><addsrcrecordid>eNp9UE1LAzEQDaJg_fgB3gKePOw6s9v9wlMpaoWC4geIl5AmE5vSbmqyW_Hfm1rx6GnmzXtvmHmMnSGkCFheLlItV2kW2xSKFDLcYwOsqywpqwr32SASZZJh_XrIjkJYAABGNGBvU_dJns9c3-rAjfO8mxO_3lDb8Sc1J90vbfvOH7ybLWnFP20352PXhn617qxruWz1ltS9-oHO8EcKrveKwgk7MHIZ6PS3HrOXm-vn8SSZ3t_ejUfTROVF0yUGqDL5sFBAjQYCrKQsSpgZNcyboi5qgiFoUApNZWSdN2ZmMqOw0aiMxCo_Zhe7vXO5FGtvV9J_CSetmIymYjsDzLGui2yDUXu-0669--gpdGIRj23jeSIDaLDMh1UdVbhTKe9C8GT-1iKIbdxiIWLcYhu3gELEuKPnaueh-OrGkhdBWWoVaetJdUI7-4_7G1p-h-o</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2009163478</pqid></control><display><type>article</type><title>Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources</title><source>Elsevier ScienceDirect Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Carlier, J. ; Moukrim, A. ; Sahli, A.</creator><creatorcontrib>Carlier, J. ; Moukrim, A. ; Sahli, A.</creatorcontrib><description>The Event Scheduling Problem with Consumption and Production of Resources (ESPCPR) is a general scheduling problem where the availability of a resource is depleted and replenished at the occurrence times of a set of events. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where activities are replaced by events, which have to be scheduled subject to generalized precedence relations. The aim of this paper is to show the connections between ESPCPR and classical scheduling problems in order to bring new lower bounds for ESPCPR. We start by recalling some similar models in literature such as the Project Scheduling with Inventory Constraints and the Financing Problem. Subsequently, we describe how to model classical scheduling problems using ESPCPR. Finally, we propose four lower bounds for this problem. The obtained computational results confirm their effectiveness.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2016.05.021</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Computer Science ; Lower bound ; Lower bounds ; Makespan ; Nonrenewable resources ; Operations Research ; Problem solving ; Resource scheduling ; Scheduling ; Scheduling problems ; Studies</subject><ispartof>Discrete Applied Mathematics, 2018-01, Vol.234, p.178-194</ispartof><rights>2016 Elsevier B.V.</rights><rights>Copyright Elsevier BV Jan 10, 2018</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-f0e7f345c0e9d0e017aa560bfc4395858e040d0cc1f7fa839fbf2fc19d1cfa173</citedby><cites>FETCH-LOGICAL-c359t-f0e7f345c0e9d0e017aa560bfc4395858e040d0cc1f7fa839fbf2fc19d1cfa173</cites><orcidid>0000-0003-0151-6327 ; 0000-0002-1528-4849</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0166218X16302463$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,776,780,881,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttps://hal.science/hal-01318852$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Carlier, J.</creatorcontrib><creatorcontrib>Moukrim, A.</creatorcontrib><creatorcontrib>Sahli, A.</creatorcontrib><title>Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources</title><title>Discrete Applied Mathematics</title><description>The Event Scheduling Problem with Consumption and Production of Resources (ESPCPR) is a general scheduling problem where the availability of a resource is depleted and replenished at the occurrence times of a set of events. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where activities are replaced by events, which have to be scheduled subject to generalized precedence relations. The aim of this paper is to show the connections between ESPCPR and classical scheduling problems in order to bring new lower bounds for ESPCPR. We start by recalling some similar models in literature such as the Project Scheduling with Inventory Constraints and the Financing Problem. Subsequently, we describe how to model classical scheduling problems using ESPCPR. Finally, we propose four lower bounds for this problem. The obtained computational results confirm their effectiveness.</description><subject>Computer Science</subject><subject>Lower bound</subject><subject>Lower bounds</subject><subject>Makespan</subject><subject>Nonrenewable resources</subject><subject>Operations Research</subject><subject>Problem solving</subject><subject>Resource scheduling</subject><subject>Scheduling</subject><subject>Scheduling problems</subject><subject>Studies</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEQDaJg_fgB3gKePOw6s9v9wlMpaoWC4geIl5AmE5vSbmqyW_Hfm1rx6GnmzXtvmHmMnSGkCFheLlItV2kW2xSKFDLcYwOsqywpqwr32SASZZJh_XrIjkJYAABGNGBvU_dJns9c3-rAjfO8mxO_3lDb8Sc1J90vbfvOH7ybLWnFP20352PXhn617qxruWz1ltS9-oHO8EcKrveKwgk7MHIZ6PS3HrOXm-vn8SSZ3t_ejUfTROVF0yUGqDL5sFBAjQYCrKQsSpgZNcyboi5qgiFoUApNZWSdN2ZmMqOw0aiMxCo_Zhe7vXO5FGtvV9J_CSetmIymYjsDzLGui2yDUXu-0669--gpdGIRj23jeSIDaLDMh1UdVbhTKe9C8GT-1iKIbdxiIWLcYhu3gELEuKPnaueh-OrGkhdBWWoVaetJdUI7-4_7G1p-h-o</recordid><startdate>20180110</startdate><enddate>20180110</enddate><creator>Carlier, J.</creator><creator>Moukrim, A.</creator><creator>Sahli, A.</creator><general>Elsevier B.V</general><general>Elsevier BV</general><general>Elsevier</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><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-0151-6327</orcidid><orcidid>https://orcid.org/0000-0002-1528-4849</orcidid></search><sort><creationdate>20180110</creationdate><title>Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources</title><author>Carlier, J. ; Moukrim, A. ; Sahli, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-f0e7f345c0e9d0e017aa560bfc4395858e040d0cc1f7fa839fbf2fc19d1cfa173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science</topic><topic>Lower bound</topic><topic>Lower bounds</topic><topic>Makespan</topic><topic>Nonrenewable resources</topic><topic>Operations Research</topic><topic>Problem solving</topic><topic>Resource scheduling</topic><topic>Scheduling</topic><topic>Scheduling problems</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Carlier, J.</creatorcontrib><creatorcontrib>Moukrim, A.</creatorcontrib><creatorcontrib>Sahli, A.</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><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Carlier, J.</au><au>Moukrim, A.</au><au>Sahli, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2018-01-10</date><risdate>2018</risdate><volume>234</volume><spage>178</spage><epage>194</epage><pages>178-194</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>The Event Scheduling Problem with Consumption and Production of Resources (ESPCPR) is a general scheduling problem where the availability of a resource is depleted and replenished at the occurrence times of a set of events. This problem is an extension of the Resource Constrained Project Scheduling Problem (RCPSP) where activities are replaced by events, which have to be scheduled subject to generalized precedence relations. The aim of this paper is to show the connections between ESPCPR and classical scheduling problems in order to bring new lower bounds for ESPCPR. We start by recalling some similar models in literature such as the Project Scheduling with Inventory Constraints and the Financing Problem. Subsequently, we describe how to model classical scheduling problems using ESPCPR. Finally, we propose four lower bounds for this problem. The obtained computational results confirm their effectiveness.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2016.05.021</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0003-0151-6327</orcidid><orcidid>https://orcid.org/0000-0002-1528-4849</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-218X |
| ispartof | Discrete Applied Mathematics, 2018-01, Vol.234, p.178-194 |
| issn | 0166-218X 1872-6771 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01318852v1 |
| source | Elsevier ScienceDirect Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Computer Science Lower bound Lower bounds Makespan Nonrenewable resources Operations Research Problem solving Resource scheduling Scheduling Scheduling problems Studies |
| title | Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T22%3A37%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Lower%20bounds%20for%20the%20Event%20Scheduling%20Problem%20with%20Consumption%20and%20Production%20of%20Resources&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Carlier,%20J.&rft.date=2018-01-10&rft.volume=234&rft.spage=178&rft.epage=194&rft.pages=178-194&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2016.05.021&rft_dat=%3Cproquest_hal_p%3E2009163478%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2009163478&rft_id=info:pmid/&rft_els_id=S0166218X16302463&rfr_iscdi=true |