Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates
- Autores
- Cafaro, Diego Carlos; Cerda, Jaime
- Año de publicación
- 2008
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. Recently, anMILPcontinuous problem representation in both time and volume providing better schedules at much lower computational cost has been published.However, all model-based scheduling techniques were applied to examples assuming a static market environment, a short single-period time horizon and a unique due-date for all deliveries at the horizon end. In contrast, pipeline operators generally use a monthly planning horizon divided into a number of equal-length periods and a cyclic scheduling strategy to fulfill terminal demands at period ends. Moreover, the rerouting of shipments and time-dependent product requirements at distribution terminals force the scheduler to continuously update pipeline operations. To address such big challenges facing the pipeline industry, thiswork presents an efficient MILP continuous-time framework for the dynamic scheduling of pipelines over a multiperiod moving horizon. At the completion time of the current period, the planning horizon moves forward and the re-scheduling process based on updated problem data is triggered again over the newhorizon. Pumping runs may extend over two or more periods and a different sequence of batches may be injected at each one. The approach has successfully solved a real-world pipeline scheduling problem involving the transportation of four products to five destinations over a rolling horizon always comprising four 1-week periods.
Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina - Materia
-
Multiproduct Pipelines
Dynamic Scheduling
Multiple Delivery Due Dates
Rolling Horizon
Optimization Approach - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/25375
Ver los metadatos del registro completo
id |
CONICETDig_d6729780341ffe2b5d695dba731818ae |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/25375 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due DatesCafaro, Diego CarlosCerda, JaimeMultiproduct PipelinesDynamic SchedulingMultiple Delivery Due DatesRolling HorizonOptimization Approachhttps://purl.org/becyt/ford/2.4https://purl.org/becyt/ford/2Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. Recently, anMILPcontinuous problem representation in both time and volume providing better schedules at much lower computational cost has been published.However, all model-based scheduling techniques were applied to examples assuming a static market environment, a short single-period time horizon and a unique due-date for all deliveries at the horizon end. In contrast, pipeline operators generally use a monthly planning horizon divided into a number of equal-length periods and a cyclic scheduling strategy to fulfill terminal demands at period ends. Moreover, the rerouting of shipments and time-dependent product requirements at distribution terminals force the scheduler to continuously update pipeline operations. To address such big challenges facing the pipeline industry, thiswork presents an efficient MILP continuous-time framework for the dynamic scheduling of pipelines over a multiperiod moving horizon. At the completion time of the current period, the planning horizon moves forward and the re-scheduling process based on updated problem data is triggered again over the newhorizon. Pumping runs may extend over two or more periods and a different sequence of batches may be injected at each one. The approach has successfully solved a real-world pipeline scheduling problem involving the transportation of four products to five destinations over a rolling horizon always comprising four 1-week periods.Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaElsevier2008-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/25375Cafaro, Diego Carlos; Cerda, Jaime; Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates; Elsevier; Computers and Chemical Engineering; 32; 4-5; 12-2008; 728-7530098-1354CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.compchemeng.2007.03.002info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0098135407000592info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:03:34Zoai:ri.conicet.gov.ar:11336/25375instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:03:35.21CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
title |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
spellingShingle |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates Cafaro, Diego Carlos Multiproduct Pipelines Dynamic Scheduling Multiple Delivery Due Dates Rolling Horizon Optimization Approach |
title_short |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
title_full |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
title_fullStr |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
title_full_unstemmed |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
title_sort |
Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates |
dc.creator.none.fl_str_mv |
Cafaro, Diego Carlos Cerda, Jaime |
author |
Cafaro, Diego Carlos |
author_facet |
Cafaro, Diego Carlos Cerda, Jaime |
author_role |
author |
author2 |
Cerda, Jaime |
author2_role |
author |
dc.subject.none.fl_str_mv |
Multiproduct Pipelines Dynamic Scheduling Multiple Delivery Due Dates Rolling Horizon Optimization Approach |
topic |
Multiproduct Pipelines Dynamic Scheduling Multiple Delivery Due Dates Rolling Horizon Optimization Approach |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.4 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. Recently, anMILPcontinuous problem representation in both time and volume providing better schedules at much lower computational cost has been published.However, all model-based scheduling techniques were applied to examples assuming a static market environment, a short single-period time horizon and a unique due-date for all deliveries at the horizon end. In contrast, pipeline operators generally use a monthly planning horizon divided into a number of equal-length periods and a cyclic scheduling strategy to fulfill terminal demands at period ends. Moreover, the rerouting of shipments and time-dependent product requirements at distribution terminals force the scheduler to continuously update pipeline operations. To address such big challenges facing the pipeline industry, thiswork presents an efficient MILP continuous-time framework for the dynamic scheduling of pipelines over a multiperiod moving horizon. At the completion time of the current period, the planning horizon moves forward and the re-scheduling process based on updated problem data is triggered again over the newhorizon. Pumping runs may extend over two or more periods and a different sequence of batches may be injected at each one. The approach has successfully solved a real-world pipeline scheduling problem involving the transportation of four products to five destinations over a rolling horizon always comprising four 1-week periods. Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina |
description |
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. Recently, anMILPcontinuous problem representation in both time and volume providing better schedules at much lower computational cost has been published.However, all model-based scheduling techniques were applied to examples assuming a static market environment, a short single-period time horizon and a unique due-date for all deliveries at the horizon end. In contrast, pipeline operators generally use a monthly planning horizon divided into a number of equal-length periods and a cyclic scheduling strategy to fulfill terminal demands at period ends. Moreover, the rerouting of shipments and time-dependent product requirements at distribution terminals force the scheduler to continuously update pipeline operations. To address such big challenges facing the pipeline industry, thiswork presents an efficient MILP continuous-time framework for the dynamic scheduling of pipelines over a multiperiod moving horizon. At the completion time of the current period, the planning horizon moves forward and the re-scheduling process based on updated problem data is triggered again over the newhorizon. Pumping runs may extend over two or more periods and a different sequence of batches may be injected at each one. The approach has successfully solved a real-world pipeline scheduling problem involving the transportation of four products to five destinations over a rolling horizon always comprising four 1-week periods. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-12 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/25375 Cafaro, Diego Carlos; Cerda, Jaime; Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates; Elsevier; Computers and Chemical Engineering; 32; 4-5; 12-2008; 728-753 0098-1354 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/25375 |
identifier_str_mv |
Cafaro, Diego Carlos; Cerda, Jaime; Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates; Elsevier; Computers and Chemical Engineering; 32; 4-5; 12-2008; 728-753 0098-1354 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.compchemeng.2007.03.002 info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0098135407000592 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1842269808307994624 |
score |
13.13397 |