Publication
Rolling-horizon algorithm for scheduling under time-dependent utility pricing and availability
dc.contributor.author | Castro, Pedro | |
dc.contributor.author | Harjunkoski, Iiro | |
dc.contributor.author | Grossmann, Ignacio E. | |
dc.date.accessioned | 2011-01-14T14:24:10Z | |
dc.date.available | 2011-01-14T14:24:10Z | |
dc.date.issued | 2010-06-06 | |
dc.description.abstract | This work addresses the scheduling of continuous single-stage multiproduct plants with energy intensive processing tasks and time-dependent electricity cost and power supply. A new rolling horizon algorithm is proposed that consists of a planning model to predict the production levels and a continuous-time model for detailed scheduling. The results from a set of test problems from the literature show that the algorithm can generate global optimal solutions much more rapidly than standalone discrete or continuous-time formulations in problems involving unlimited power availability. | por |
dc.identifier.citation | Castro, P.; Harjunkoski, I.; Grossmann, E. Rolling-horizon algorithm for scheduling under time-dependent utility pricing and availability. In: Computer Aided Chemical Engineering, vol. 28, - ESCAPE-20th European Symposium on Computer Aided Process, Ischia, Italy, Hunho 6-9, 2010 | por |
dc.identifier.uri | http://hdl.handle.net/10400.9/1104 | |
dc.language.iso | other | por |
dc.peerreviewed | yes | por |
dc.relation.ispartofseries | Pedro; | |
dc.subject | Continuos-time | por |
dc.subject | Resource-task network | por |
dc.subject | Planning | por |
dc.subject | Electricity | por |
dc.title | Rolling-horizon algorithm for scheduling under time-dependent utility pricing and availability | por |
dc.type | conference object | |
dspace.entity.type | Publication | |
oaire.citation.conferencePlace | Ischia, Italy | por |
oaire.citation.title | Computer Aided Chemical Engineering, vol. 28, - ESCAPE-20th European Symposium on Computer Aided Process | por |
rcaap.rights | openAccess | por |
rcaap.type | conferenceObject | por |