Scheduling and optimisation of batch plants: model development and comparison of approaches
by Yaqing Tan; Wei Huang; Yanming Sun; Yong Yue
International Journal of Computer Applications in Technology (IJCAT), Vol. 49, No. 3/4, 2014

Abstract: The application of parallel machines and storage facilities provides flexibility but raises challenges for batch plants. This research proposes a scheduling model in batch plants, considering complex real-world constraints that were seldom addressed together. Two optimisation approaches, genetic algorithm (GA) and constraint programming (CP), are applied to solve the complex batch plant scheduling problem. A case study and scalability tests are conducted to investigate different performance of GA and CP in the problem to prepare for further research application. It is found that the CP approach has a better performance in solving batch plant scheduling problems with complex constraints although it needs longer time. The 'restart' search strategy is better than two other search strategies for the CP approach.

Online publication date: Mon, 02-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com