2.50
Hdl Handle:
http://hdl.handle.net/10547/276034
Title:
Integrating routing and scheduling for pipeless plants in different layouts
Authors:
Huang, Wei; Chung, Paul Wai Hing
Abstract:
Pipeless batch plants are built to provide the ability to adapt to fast market changes. The scheduling of pipeless plants adds new challenges to the scheduling of conventional batch plants. This is because of the requirement to consider the allocation of resources and also the plant layout so that vessels can move from one processing station to another without conflict. This research investigates the integrated problem of scheduling and routing in pipeless plants and develops a constraint-based methodology suitable for different layouts. During the scheduling process, besides time and resource allocation, a planner is also called to find possible routes to move vessels from one processing station to the next proposed station. Each of the dynamically generated routes is immediately check for feasible track allocation so that any infeasible route is discarded as soon as possible to save computational time. A typical scheduling problem and results are described in detail to show how this integrated approach works.
Affiliation:
Department of Computing and Information Systems, University of Luton; Department of Computer Science, Loughborough University
Citation:
Huang, W. and Chung, P.W.H., (2005) 'Integrating routing and scheduling for pipeless plants in different layouts', Computers and chemical engineering 29 (5): 1069-1081
Publisher:
Elsevier
Journal:
Computers and chemical engineering
Issue Date:
2005
URI:
http://hdl.handle.net/10547/276034
DOI:
10.1016/j.compchemeng.2004.11.006,
Additional Links:
http://www.sciencedirect.com/science/article/pii/S0098135404003394
Type:
Article
Language:
en
ISSN:
0098-1354
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorHuang, Weien_GB
dc.contributor.authorChung, Paul Wai Hingen_GB
dc.date.accessioned2013-03-26T13:03:44Z-
dc.date.available2013-03-26T13:03:44Z-
dc.date.issued2005-
dc.identifier.citationHuang, W. and Chung, P.W.H., (2005) 'Integrating routing and scheduling for pipeless plants in different layouts', Computers and chemical engineering 29 (5): 1069-1081en_GB
dc.identifier.issn0098-1354-
dc.identifier.doi10.1016/j.compchemeng.2004.11.006,-
dc.identifier.urihttp://hdl.handle.net/10547/276034-
dc.description.abstractPipeless batch plants are built to provide the ability to adapt to fast market changes. The scheduling of pipeless plants adds new challenges to the scheduling of conventional batch plants. This is because of the requirement to consider the allocation of resources and also the plant layout so that vessels can move from one processing station to another without conflict. This research investigates the integrated problem of scheduling and routing in pipeless plants and develops a constraint-based methodology suitable for different layouts. During the scheduling process, besides time and resource allocation, a planner is also called to find possible routes to move vessels from one processing station to the next proposed station. Each of the dynamically generated routes is immediately check for feasible track allocation so that any infeasible route is discarded as soon as possible to save computational time. A typical scheduling problem and results are described in detail to show how this integrated approach works.en_GB
dc.language.isoenen
dc.publisherElsevieren_GB
dc.relation.urlhttp://www.sciencedirect.com/science/article/pii/S0098135404003394en_GB
dc.subjectschedulingen_GB
dc.subjectroutingen_GB
dc.titleIntegrating routing and scheduling for pipeless plants in different layoutsen
dc.typeArticleen
dc.contributor.departmentDepartment of Computing and Information Systems, University of Lutonen_GB
dc.contributor.departmentDepartment of Computer Science, Loughborough Universityen_GB
dc.identifier.journalComputers and chemical engineeringen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.