{"id":{"repo_id":"vu-aus","oai_identifier":"oai:eprints.vu.edu.au:15738"},"canonical_url":"https://search.dev.ndltd.org/etd/vu-aus/oai:eprints.vu.edu.au:15738","repository":{"repo_id":"vu-aus","name":"Victoria University (Australia)","base_url":"https://vuir.vu.edu.au/cgi/oai2"},"display":{"title":"Algorithms for pipeline transfer scheduling","abstract":"A 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.","abstract_html":"A 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.","abstract_has_math":false,"creators":["Young, John Andrew"],"institution":"Victoria University of Technology","degree_name":null,"degree_level":"rmaster","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1992,"date_issued":"1992","date_published":"1992","updated_at":"2026-07-24T06:33:17Z","subjects":["0102 Applied Mathematics","0910 Manufacturing Engineering","School of Engineering and Science"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Young, John Andrew"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1992"]},{"key":"dc:date.issued","label":"Date","values":["1992"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Computer and Mathematical Sciences"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["Victoria University of Technology"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://vuir.vu.edu.au/15738/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["rmaster"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["0102 Applied Mathematics","0910 Manufacturing Engineering","School of Engineering and Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://vuir.vu.edu.au/15738/1/Young_1992compressed.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A 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."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dc:title","label":"Title","values":["Algorithms for pipeline transfer scheduling"]}]}],"canonical_facts":{"dc:creator":["Young, John Andrew"],"dc:date":["1992"],"dc:date.issued":["1992"],"dc:description.abstract":["A 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."],"dc:format":["text"],"dc:identifier.uri":["https://vuir.vu.edu.au/15738/1/Young_1992compressed.pdf"],"dc:language":["en"],"dc:publisher.department":["Department of Computer and Mathematical Sciences"],"dc:publisher.institution":["Victoria University of Technology"],"dc:relation.isreferencedby":["https://vuir.vu.edu.au/15738/"],"dc:subject":["0102 Applied Mathematics","0910 Manufacturing Engineering","School of Engineering and Science"],"dc:title":["Algorithms for pipeline transfer scheduling"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["rmaster"]},"updated_at":"2026-07-24T06:33:17Z"}