The complexity of makespan minimization for pipeline transportation.

DOI10.1016/S0304-3975(03)00291-3zbMath1039.90018OpenAlexW2096524872MaRDI QIDQ1426458

Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00291-3

zbMATH Keywords

ComplexityTransportationApproximabilityOil pipelinePetroleum

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Approximation algorithms (68W25)

Cites Work

• Sequencing inputs to multi-commodity pipelines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of makespan minimization for pipeline transportation.