Minimizing Cycle Time Of Job Scheduling Using Petri Nets a Study of Heuristic Methods

The objective of this paper is a study of minimizing the maximum completion time min Fmax, or cycle time of the last job of a given family of jobs using flow shop heuristic scheduling techniques. Three methods are presented: minimize idle time (MIT); Campbell, Dudek and Smith (CDS); and Palmer. An example problem with ten jobs and five machines is used to compare results of these methods. A deterministic t-timed colored Petri net model has been developed for scheduling problem. An execution of the deterministic timed Petri net allows to compute performance measures by applying graph traversing algorithms starting from initial global state and going into a desirable final state(s) of the production system. The objective of the job scheduling policy is minimizing the cycle time of the last job scheduled in the pipeline of a given family of jobs. Three heuristic scheduling methods have been implemented. First, a sub-optimal sequence of jobs to be scheduled is generated. Second, a Petri net-based simulator with graphical user interface to monitor execution of the sequence of tasks on machines is dynamically designed. A deterministic t-timed colored Petri net model has been developed and implemented for flexible manufacturing systems (FMS). An execution of the deterministic timed Petri net into a reachability graph allows to compute performance measures by applying graph traversing algorithms starting from initial global state to a desirable final state(s) of the production system.

[1]  Xiaolan Xie,et al.  A class of Petri nets for manufacturing system integration , 1997, IEEE Trans. Robotics Autom..

[2]  Torbjorn Liljenvall.  Benchmarking an algorithm for Petri net scheduling , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[3]  Joaquín Ezpeleta,et al.  Automatic synthesis of colored Petri nets for the control of FMS , 1997, IEEE Trans. Robotics Autom..

[4]  Milton L. Smith,et al.  Increasing the production rate of a just-in-time production system with variable operation times , 1988 .

[5]  Ibrahim Al-Qattan,et al.  Designing flexible manufacturing cells using a branch and bound method , 1990 .

[6]  Itsuo Hatono,et al.  Modeling and On-Line Scheduling of Flexible Manufacturing Systems Using Stochastic Petri Nets , 1991, IEEE Trans. Software Eng..

[7]  John L. Burbidge.  Operation scheduling with GT and PBC , 1988 .

[8]  O. V. Krishnaiah Chetty,et al.  Priority nets for scheduling flexible manufacturing systems , 1993 .

[9]  R. Radharamanan.  A heuristic algorithm for group scheduling , 1986 .

[10]  Simon Peck,et al.  Practice of Petri Nets in Manufacturing , 1993 .

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

[12]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[13]  J. King,et al.  Machine-component group formation in group technology: review and extension , 1982 .

[14]  Philippe Chrétienne,et al.  Timed Petri net schedules , 1987, European Workshop on Applications and Theory of Petri Nets.

[15]  I. A. Kattan,et al.  Design and scheduling of hybridmulti-cell flexible manufacturing systems , 1997 .

[16]  Zbigniew Banaszak,et al.  Modeling of Manufacturing Systems , 1994 .