Abstract
dc:description.abstractA common logistics problem in the petroleum industry is the scheduling of the pipeline transfer of petroleum fuels from oil refineries to distribution terminals. With a fixed set of pipelines, each with its own restrictions and constraints, the scheduler must organize the products and timing of transfers through each pipeline so as to deliver the required quantity of each product to the appropriate terminals to meet the demands of the market. Of the many possible approaches to the scheduling problem which are reviewed in this thesis one basic approach was chosen for future research. Specifically this thesis results from an investigation of the feasibility of using a tree-search algorithm based upon a similar approach successfully used in paper machine trim scheduling.
Degree
thesis:*- Level dc:type.qualificationlevel
- rmaster
- Grantor dc:publisher.institution
- Victoria University of Technology
- Year dc:date.issued
- 1992
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Young, John Andrew
Subjects
dc:subject × 3Rights
- Language dc:language
- en