Abstract
SPTP is a model for the pipeline transportation of petroleum products. It uses a directed graph G, where arcs represent pipes and nodes represent locations. In this paper, we analyze the complexity of finding a minimum makespan solution to SPTP. This problem is called SPTMP. We prove that, for any ∈ > 0, there is no η1-∈ -approximate algorithm for the SPTMP unless P = NP, where η is the input size. This result also holds if G is both planar and acyclic. If G is acyclic, then we give a m-approximate algorithm to SPTMP, where m is the number of arcs in G.
Sponsored by CTPetro/FINEP, CENPES/Petrobras, and FAPERJ
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
Eduardo Camponogara. A-teams para um problema de transporte de deriva-dos de petróleo. Master’s thesis, Departamento de Ciência da Computaç~ao, IMECC-UNICAMP, December 1995.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
Christopher A. Hane and H. Donald Ratliff. Sequencing inputs to multi-commodity pipelines. Annals of Operations Research, 57, 1995. Mathematics of Industrial Systems I.
Viggo Kann. Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing, 1(3):317–331, 1994.
Ruy L. Milidiú, Eduardo S. Laber, Artur A. Pessoa, and Pablo A. Rey. Petroleum products scheduling in pipelines. In The International Work-shop on Harbour, Maritime & Industrial Logistics Modeling and Simulation, september 1999.
Ruy L. Milidiú, Artur A. Pessoa, and Eduardo S. Laber. Transporting petroleum products in pipelines (abstract). In ISMP 2000-17th Interna-tional Symposium on Mathematical Programming, pages 134–135, Atlanta, Georgia, USA, August 2000.
Ruy L. Milidiú, Artur A. Pessoa, and Eduardo S. Laber. Pipeline trans-portation of petroleum products with no due dates. In Proceedings of the LATIN’2002, pages 248–262, Canún, Mexico, april 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milidiú, R.L., Pessoa, A.A., Laber, E.S. (2002). Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. In: Jansen, K., Leonardi, S., Vazirani, V. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2002. Lecture Notes in Computer Science, vol 2462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45753-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-45753-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44186-1
Online ISBN: 978-3-540-45753-4
eBook Packages: Springer Book Archive