2.50
Hdl Handle:
http://hdl.handle.net/10547/276012
Title:
Scheduling of pipeless batch plants using constraint satisfaction techniques
Authors:
Huang, Wei; Chung, Paul Wai Hing
Abstract:
Process industries need to be able to adapt to the fast changing market in order to meet consumer demands. Pipeless batch plants are being developed and implemented to improve flexibility to meet this requirement. However, their efficiency greatly depends on the generation of feasible production schedules. This paper proposes a general constraint model to solve this kind of scheduling problem for pipeless batch plants. In this model, constraints on resource allocation, activity precedence, time bound and safety issues are considered. A computer system, BPS, based on the constraint model and the search algorithm used in BPS are also presented. A case study is described to demonstrate the applicability of the proposed approach.
Affiliation:
Department of Computer Science, Loughborough University
Citation:
Huang, W., Chung, P.W.H. (2000), 'Scheduling of pipeless batch plants using constraint satisfaction techniques', Computers & Chemical Engineering 24 (2-7):377-383
Publisher:
Elsevier
Journal:
Computers & Chemical Engineering
Issue Date:
2000
URI:
http://hdl.handle.net/10547/276012
DOI:
10.1016/S0098-1354(00)00483-X
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S009813540000483X
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-26T12:22:27Z-
dc.date.available2013-03-26T12:22:27Z-
dc.date.issued2000-
dc.identifier.citationHuang, W., Chung, P.W.H. (2000), 'Scheduling of pipeless batch plants using constraint satisfaction techniques', Computers & Chemical Engineering 24 (2-7):377-383en_GB
dc.identifier.issn0098-1354-
dc.identifier.doi10.1016/S0098-1354(00)00483-X-
dc.identifier.urihttp://hdl.handle.net/10547/276012-
dc.description.abstractProcess industries need to be able to adapt to the fast changing market in order to meet consumer demands. Pipeless batch plants are being developed and implemented to improve flexibility to meet this requirement. However, their efficiency greatly depends on the generation of feasible production schedules. This paper proposes a general constraint model to solve this kind of scheduling problem for pipeless batch plants. In this model, constraints on resource allocation, activity precedence, time bound and safety issues are considered. A computer system, BPS, based on the constraint model and the search algorithm used in BPS are also presented. A case study is described to demonstrate the applicability of the proposed approach.en_GB
dc.language.isoenen
dc.publisherElsevieren_GB
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S009813540000483Xen_GB
dc.rightsArchived with thanks to Computers & Chemical Engineeringen_GB
dc.titleScheduling of pipeless batch plants using constraint satisfaction techniquesen
dc.typeArticleen
dc.contributor.departmentDepartment of Computer Science, Loughborough Universityen_GB
dc.identifier.journalComputers & Chemical Engineeringen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.