Send the link below via email or IMCopy
Present to your audienceStart remote presentation
- Invited audience members will follow you as you navigate and present
- People invited to a presentation do not need a Prezi account
- This link expires 10 minutes after you close the presentation
- A maximum of 30 users can follow your presentation
- Learn more about this feature in our knowledge base article
Product schedule optimization Literature survey
Transcript of Product schedule optimization Literature survey
Camacho et al.
objective was to obtain the optimal operation over the pumping equipment installed in order to diminish the electrical cost dealing with the product delivery dates at each terminal
Hane and Ratliff
used a directed graph acyclic to represent the polyduct, in which nodes represent sources and terminals and arcs represent different polyduct sections.The direction of each arc determines the sense of the flow without the possibility of considering reversible sections.
proposed a heuristic to find a feasible solution.
Mildilú et al. (2002)
used a heuristic method to get a near-optimal solution attending to the sum of the costs due to the penalties by delay in the deliveries and the costs associated with the shutdowns and starting of the pipeline.
1997 - 2002
De Felice and Charles
described the use of a simulator to obtain the optimal sequence for the pumping of new products into a network composed by two sources, three intermediate pump stations, seven terminals and twelve polyducts connecting all these elements.
Campognara and De Souza
also used a directed graph representation and considered reversible polyduct sections, limited storage capacity at terminals and forbidden product sequences.
Cafaro and Cerdá (2003)
formulated a model based on a continuous time approach. Since Rejowski and Pinto (2003) approach was continuous, they did not make any hypothesis on the size of the slugs injected in the polyduct. The model was applied over the same system considered by Rejowski and Pinto (2003, 2004). The results were better than the work by Rejowski and Pinto (2003, 2004) in terms of CPU time reduction.
Rejowski and Pinto (2003)
proposed an MILP formulation whose objective function is the sum of the pumping cost, inventory costs and the reprocessing cost associated with transmixes.
Cafaro and Cerdá (2004)
improved their previous work by adding more constraints related to the existence of forbidden product sequences.
Rejowski and Pinto (2004)
improved their previous work by adding additional constraints to perform a better calculation of the cost associated with the generation of a transmixes.
Magatao et al. (2004)
proposed another discrete approach to solve a model applied on a real world pipeline, which connects an inland refinery to a harbor, conveying different types of products.
Rejowski and Pinto (2008)
developed a novel continuous-time representation to model the same process considered in their previous papers.
Cafaro and Cerdá (2008)
extended their model to include dynamic scheduling over rolling planning horizon