• Login
    View Item 
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UOBREPCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartmentThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartment

    My Account

    LoginRegister

    About

    AboutLearning ResourcesResearch Graduate SchoolResearch InstitutesUniversity Website

    Statistics

    Display statistics

    Integrating routing and scheduling for pipeless plants in different layouts

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Publisher version
    View Source
    Access full-text PDFOpen Access
    View Source
    Check access options
    Check access options
    Authors
    Huang, Wei
    Chung, Paul Wai Hing
    Affiliation
    University of Luton
    Loughborough University
    Issue Date
    2005
    Subjects
    scheduling
    routing
    
    Metadata
    Show full item record
    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.
    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
    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
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.compchemeng.2004.11.006,
    Scopus Count
    Collections
    Centre for Research in Distributed Technologies (CREDIT)

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.