The complexity of makespan minimization for pipeline transportation
- 5 September 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 306 (1-3) , 339-351
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum ProductsLecture Notes in Computer Science, 2002
- Pipeline Transportation of Petroleum Products with No Due DatesLecture Notes in Computer Science, 2002
- Sequencing inputs to multi-commodity pipelinesAnnals of Operations Research, 1995