Timed petri-net based formulation and an algorithm for the optimal scheduling of batch plants

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.

[1]  In-Beum Lee,et al.  Optimal Scheduling of Multiproduct Batch Processes for Various Intermediate Storage Policies , 1996 .

[2]  Kamal Kuriyan,et al.  SCHEDULING OF BATCH PROCESSES , 1987 .

[3]  H.-M. Hanisch.  Coordination Control Modelling in Batch Production Systems by Means of Petri Nets , 1992 .

[4]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[5]  MengChu Zhou,et al.  Modeling, Simulation, and Control of Flexible Manufacturing Systems - A Petri Net Approach , 1999, Series in Intelligent Control and Intelligent Automation.

[6]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[7]  Omar Chiotti,et al.  Modeling of the supervising control system of a multipurpose batch plant , 1997 .

[8]  Iftekhar A. Karimi,et al.  Scheduling in batch processes , 1987 .

[9]  L. Puigjaner,et al.  Sequencing intermediate products: A practical solution for multipurpose production scheduling , 1996 .

[10]  Hongnian Yu,et al.  Hybrid heuristic search for the scheduling of flexible manufacturing systems using Petri nets , 2002, IEEE Trans. Robotics Autom..

[11]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[12]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Ferenc Friedler,et al.  Combinatorial technique for short term scheduling of multipurpose batch plants based on schedule-graph representation , 1998 .

[14]  Jeffrey C. Kantor,et al.  Modeling and optimal control of discrete-event chemical processes using petri nets , 1991 .

[15]  David W.T. Rippin,et al.  Batch process systems engineering: A retrospective and prospective review , 1993 .

[16]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[17]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[18]  Tianlong Gu,et al.  Timed Petri-net representation for short term scheduling of multiproduct batch plants , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[19]  Tianlong Gu,et al.  A survey of Petri net applications in batch processes , 2002, Comput. Ind..

[20]  Gintaras V. Reklaitis,et al.  Optimal design of multipurpose batch plants. 1. Problem formulation , 1990 .

[21]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[22]  Iftekhar A. Karimi,et al.  Completion time algorithms for serial multiproduct batch processes with shared storage , 1990 .

[23]  Shigeru Okuma,et al.  FMS scheduling based on Petri net model , 2001, Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560).

[24]  Shigeru Okuma,et al.  FMS scheduling based on timed Petri net model and RTA* algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).