• DocumentCode
    2409222
  • Title

    Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming

  • Author

    Bourdeaud´huy, Thomas ; Hanafi, Said ; Yim, Pascal

  • Author_Institution
    Ecole Centrale de Lille, Villeneuve d´´Ascq
  • fYear
    2006
  • fDate
    10-12 July 2006
  • Firstpage
    94
  • Lastpage
    99
  • Abstract
    In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with "flexible" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy
  • Keywords
    Petri nets; flexible manufacturing systems; mathematical programming; reachability analysis; scheduling; flexible manufacturing system scheduling; mathematical programming; reachability problem; timed Petri nets; Computer science; Concurrent computing; Flexible manufacturing systems; Job shop scheduling; Mathematical model; Mathematical programming; Parallel processing; Petri nets; Processor scheduling; Production;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Discrete Event Systems, 2006 8th International Workshop on
  • Conference_Location
    Ann Arbor, MI
  • Print_ISBN
    1-4244-0053-8
  • Type

    conf

  • DOI
    10.1109/WODES.2006.1678414
  • Filename
    1678414
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2409222