This work addresses the short term scheduling problem involved in the pipeline transportation of refined petroleum products to distribution centers serving local markets. A new continuous time formulation is proposed that can handle complex treelike systems involving multiple refineries and depots. The novelty concerns the modeling of the complex storage policy associated with the flow of multiple products inside the pipeline. This is accomplished through the use of real and accumulated volume resources for every product coupled with filling, moving and emptying tasks under the scope of the resource-task network process representation. Computational studies are performed to compare the performance of the new approach to three models from the literature that rely on the concept of batches rather than events to model what is in reality a continuous system. The results show that the proposed approach is wider in scope with the typical drawback of being less efficient for structural subclasses of the general problem.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal scheduling of pipeline systems with a resourcetask network continuous-time formulation


    Contributors:

    Published in:

    Publication date :

    2010


    Size :

    15 Seiten, 18 Bilder, 5 Tabellen, 26 Quellen




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    A Continuous-Time Approach for Scheduling Bidirectional Pipeline Operations

    Cafaro, Vanina G. / Cafaro, Diego C. / Cerda, Jaime | Tema Archive | 2012


    Optimal Continuous-Time Job Scheduling for Multiple Low Earth Orbit Satellites

    Cho, Doo-Hyun / Kim, Ho-Yeon / Choi, Han-Lim | AIAA | 2016


    Overview for Pipeline Scheduling

    Tu, Renfu / Li, Zhengbing | Springer Verlag | 2023


    Optimal Sustained Rendezvous Guidance for Continuous Time Systems

    Gitizadeh, R. / Yaesh, I. / Dan Knassim | British Library Conference Proceedings | 2001