Efficiency Analysis of Scheduler based on the Division Scheduling Algorithm

분할 스케쥴링 알고리즘에 기반한 스케쥴러의 효율성 분석

  • 송유진 (창원대학교 컴퓨터공학과) ;
  • 이종근 (창원대학교 컴퓨터공학과)
  • Published : 2004.01.01


We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.


  1. C. Valentin, Modeling and Analysis methods for a class of Hybrid Dynamic Systems, In : proceeding Symposium ADPM'94, pp. 221-226
  2. H. Hillion, J-M Proth, and X-L Xie, A Heuristic Algorithm for Scheduling and Sequence Job-Shop problem, In : proceeding 26th CDC, pp. 612-617, 1987
  3. H. Ohl, H. Camus, E. Castelain, and J-C. Gentina, 'Petri nets Modeling of Ratio-driven FMS and Implication on the WIP for Cyclic Schedules', In:Proceedinf SMC'95, pp. 3081-3086, 1995
  4. H. Camus, Conduite de systemes Flexibles de Production Manu- facturiere par composition de regimes permanents cycliques : modelisation et evaluation de performances a l'aide des Reseaux de Petri, These de doctorat USTL 1, mars 1997
  5. J. K. Lee, O. Korbaa, and J. C. Gentina, 'Modeling and analysis of Cycle scheduling using Petri nets unfolding', In : proceeding IEEE SMC'01, pp. 2611-2616, 2001
  6. J. K. Lee, Une methode d'ordinnancement des systems flexibles de production manufacturiere utilisant le depliage des reseaux de Petri, These de doctorat EC Paris, mars 2002
  7. O. Korbaa, H. Camus and J-C. Gentina, 'FMS cyclc Scheduling with Overlapping production cycles', In: proceedings ICATPN'97, pp. 35-52, 1997
  8. O. Korbaa, Commande cyclique des systems flexibles de productiom manufacturiere a l'aide des reseaux de Petri: de la planification a l'ordonnancement des regimes transoires, These de doctorat USTL 1, juillet 1998
  9. P. Richard, 'Scheduling timed marked graphs with resources a serial method', In : proceeding INCOM'98, 1998
  10. W. Zuberek and W. Kubiah, 'Throughput Analysis of Manufacturing Cells Using Timed Petri nets', In : Proceeding ICSYMC 1993, pp. 1328-1333, 1993
  11. J. Carlier, P. Chretienne and C. Girault, Modeling Scheduling Problems with Timed Petri Nets, in Advanced in Petri Nets 1984, Lecture Notes in Computer Science, G. Goes and J. Hartmanis(eds), Springer-Verlag Pub.Co., pp. 62-82, 1985
  12. J. K. Lee, Benchmarking Study of the Cycle Scheduling Analysis Methods in FMS, In : proceeding IEEE SMC'02, 2002
  13. In : proceeding IEEE SMC'02 Benchmarking Study of the Cycle Scheduling Analysis Methods in FMS J.K.LEE