IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v70y2006i5p419-432.html
   My bibliography  Save this article

Scheduling analysis of FMS: An unfolding timed Petri nets approach

Author

Listed:
  • Lee, Jong-Kun
  • Korbaa, Ouajdi

Abstract

We are interested in Flexible Manufacturing Systems (FMS) scheduling problem. Different methods have been explored to solve this problem and mainly to master its combinatorial complexity: NP-hard in the general case. This paper presents an analysis of the cyclic scheduling for the determination of the optimal cycle time and the minimization of the Work In Process (WIP). Especially, the product ratio-driven FMS cyclic scheduling problem using timed Petri nets (TPN) unfolding is described. In addition, it has been proved that the Basic Unit of Concurrency (BUC) is a set of the executed control flows based on the behavioral properties of the net. Using our method, one could divide original system into some subnets based on machine's operations using BUC and analyze the feasibility time in each schedule. Herein, our results showed the usefulness of transitive matrix to slice off some subnets from the original net, and explained in an example.

Suggested Citation

  • Lee, Jong-Kun & Korbaa, Ouajdi, 2006. "Scheduling analysis of FMS: An unfolding timed Petri nets approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 70(5), pages 419-432.
    • Handle: RePEc:eee:matcom:v:70:y:2006:i:5:p:419-432
    DOI: 10.1016/j.matcom.2005.11.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475405002521
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2005.11.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ada Che & Vladimir Kats & Eugene Levner, 2011. "Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(1), pages 1-16, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:70:y:2006:i:5:p:419-432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.