Loughborough University
Browse
ComputersAndChemEng_vol29_pp1069-1081.pdf (316.28 kB)

Integrating routing and scheduling for pipeless plants in different layouts

Download (316.28 kB)
journal contribution
posted on 2006-08-31, 09:46 authored by W. Huang, Paul Chung
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.

History

School

  • Science

Department

  • Computer Science

Pages

285355 bytes

Citation

HUANG and CHUNG, 2005. Integrating routing and scheduling for pipeless plants in different layouts. Computers and chemical engineering, 29 (5), pp. 1069-1081

Publisher

© Elsevier

Publication date

2005

Notes

This article was published in the journal, Computers & chemical engineering [© Elsevier] and is also available at: http://www.sciencedirect.com/science/journal/00981354

ISSN

0098-1354

Language

  • en