Catalog Home Page

Timed petri nets based scheduling for batch plants with the consideration of Clean-up operation

Bahri, P.A., Gu, T. and Lee, P. (2001) Timed petri nets based scheduling for batch plants with the consideration of Clean-up operation. In: 6th World Congress of Chemical Engineering, 23-27 September 2001, Melbourne, VIC

Abstract

In this paper, timed Petri nets-based approach is extended to deal with the scheduling problems of batch plants with the consideration of clean-up times. Firstly, timed Petri nets formulation approach is given, where two different categories of cleaning requirements, sequence dependent and frequency dependent, are considered. Different Petri net structures or sub-nets are presented respectively. Secondly, a heuristic search algorithm for the optimal scheduling of batch plants with the consideration of clean-up times is presented. From the complete Petri net model of the batch plant obtained, the optimal schedule can be solved through searching the reachability tree of the firing sequence of the transitions. Finally, the effectiveness of the proposed approach and algorithm is illustrated through case studies.

Publication Type: Conference Paper
Murdoch Affiliation: School of Engineering
URI: http://researchrepository.murdoch.edu.au/id/eprint/28423
Item Control Page Item Control Page