Geodesic
Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants
International Journal of Applied Mathematics and Computer Science, Tome 13 (2003) no. 4, pp. 527-536 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural properties and performance evaluation, as well as for the systematic construction of discrete-event simulators and controllers. This paper aims at presenting a Petri-net based approach to the scheduling of operations in batch plants. Firstly, the short term of the `scheduling of batch plants' is formulated by means of a timed Petri net which can accommodate various intermediate storage policies, such as unlimited intermediate storage (UIS), no intermediate storage (NIS), finite intermediate storage (FIS), and mixed intermediate storage (MIS). Secondly, a heuristic search algorithm for the optimal scheduling of batch plants is given, which is based on generating and checking the markings in the reachability tree of the Petri-net model. Finally, the novel formulation and algorithm are tested with several simulation case studies.
Keywords: timed Petri nets, scheduling, batch plants, discrete event, algorithm, heuristic
Mots-clés : informatyka 
@article{IJAMCS_2003_13_4_a9,
     author = {Gu, T. and Bahri, P. A. and Cai, G.},
     title = {Timed {Petri-Net} {Based} {Formulation} and an {Algorithm} for the {Optimal} {Scheduling} of {Batch} {Plants}},
     journal = {International Journal of Applied Mathematics and Computer Science},
     pages = {527--536},
     year = {2003},
     volume = {13},
     number = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IJAMCS_2003_13_4_a9/}
}
TY  - JOUR
AU  - Gu, T.
AU  - Bahri, P. A.
AU  - Cai, G.
TI  - Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants
JO  - International Journal of Applied Mathematics and Computer Science
PY  - 2003
SP  - 527
EP  - 536
VL  - 13
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/IJAMCS_2003_13_4_a9/
LA  - en
ID  - IJAMCS_2003_13_4_a9
ER  - 
%0 Journal Article
%A Gu, T.
%A Bahri, P. A.
%A Cai, G.
%T Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants
%J International Journal of Applied Mathematics and Computer Science
%D 2003
%P 527-536
%V 13
%N 4
%U http://geodesic.mathdoc.fr/item/IJAMCS_2003_13_4_a9/
%G en
%F IJAMCS_2003_13_4_a9
Gu, T.; Bahri, P. A.; Cai, G. Timed Petri-Net Based Formulation and an Algorithm for the Optimal Scheduling of Batch Plants. International Journal of Applied Mathematics and Computer Science, Tome 13 (2003) no. 4, pp. 527-536. http://geodesic.mathdoc.fr/item/IJAMCS_2003_13_4_a9/