• 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

    Scheduling of batch plants: constraint-based approach and performance investigation

    • 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
    Chen, Bo
    Affiliation
    University of Luton
    University of Warwick
    Issue Date
    2007
    Subjects
    scheduling
    constraint satisfaction techniques (CST)
    batch plants
    
    Metadata
    Show full item record
    Abstract
    Batch processing plants are attractive due to their suitability for the manufacturing of small-volume, high-value added products. Scheduling batch plants by using computer-aided systems is important for improving the plant productivity, since it harmonizes the entire plant operation efficiently to achieve production goals. However, the current scheduling approaches for batch plants are inadequate. This research develops a constraint-based model and system for batch-process scheduling and investigates their performance. The proposed constraint model analyses and brings together many scheduling constraints, adds new constraints and categorizes them according to their functionality. A computer scheduling system, Batch Processing Scheduler, is developed in C++ to apply the model. A number of examples have been devised to study the performance of our constraint-based approach. It is found that the approach can schedule complex plants and solve large-size problems by finding feasible solutions satisfying all imposed constraints, which include some hard ones such as those of finite wait time. It is also identified that the first feasible solution can be found very quickly, but much more time, even exponentially more, is required to find the optimal solution particularly for complex and large-size problems. Feasibility and limitations of the proposed methodology are demonstrated by the results.
    Citation
    Wei, H. and Chen, B. (2007) 'Scheduling of batch plants: Constraint-based approach and performance investigation' International Journal of Production Economics 105 (2):425-444
    Publisher
    Elsevier
    Journal
    International Journal of Production Economics
    URI
    http://hdl.handle.net/10547/276038
    DOI
    10.1016/j.ijpe.2004.05.028
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S0925527305002392
    Type
    Article
    Language
    en
    ISSN
    0925-5273
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ijpe.2004.05.028
    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.