2.50
Hdl Handle:
http://hdl.handle.net/10547/276038
Title:
Scheduling of batch plants: constraint-based approach and performance investigation
Authors:
Huang, Wei; Chen, Bo
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.
Affiliation:
Department of Computing and Information Systems, University of Luton; Warwick Business School, University of Warwick
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
Issue Date:
2007
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
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorHuang, Weien_GB
dc.contributor.authorChen, Boen_GB
dc.date.accessioned2013-03-26T13:43:25Z-
dc.date.available2013-03-26T13:43:25Z-
dc.date.issued2007-
dc.identifier.citationWei, H. and Chen, B. (2007) 'Scheduling of batch plants: Constraint-based approach and performance investigation' International Journal of Production Economics 105 (2):425-444en_GB
dc.identifier.issn0925-5273-
dc.identifier.doi10.1016/j.ijpe.2004.05.028-
dc.identifier.urihttp://hdl.handle.net/10547/276038-
dc.description.abstractBatch 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.en_GB
dc.language.isoenen
dc.publisherElsevieren_GB
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0925527305002392en_GB
dc.rightsArchived with thanks to International Journal of Production Economicsen_GB
dc.subjectschedulingen_GB
dc.subjectconstraint satisfaction techniques (CST)en_GB
dc.subjectbatch plantsen_GB
dc.titleScheduling of batch plants: constraint-based approach and performance investigationen
dc.typeArticleen
dc.contributor.departmentDepartment of Computing and Information Systems, University of Lutonen_GB
dc.contributor.departmentWarwick Business School, University of Warwicken_GB
dc.identifier.journalInternational Journal of Production Economicsen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.