IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v2y2008i3p231-252.html
   My bibliography  Save this article

Deadlock-free scheduling of flexible job shops with limited capacity buffers

Author

Listed:
  • Sherif A. Fahmy
  • Tarek Y. ElMekkawy
  • Subramaniam Balakrishnan

Abstract

In this paper, Mixed Integer Programming (MIP) formulations of the deadlock-free job shop scheduling problem are proposed. The presence of buffer space with limited capacity is considered. This research work also proposes a novel operations insertion algorithm based on the rank matrix (or Latin rectangle). In this algorithm, rank matrices are used to generate the schedules and to check for deadlock situations. Finally, an insertion algorithm is proposed to insert transportation operations in the obtained schedules. Performance evaluations of the proposed mathematical models and the proposed algorithm are conducted. The results show that the mathematical models outperform a model presented earlier in the literature. The results also show that the proposed algorithm obtains the same or better solutions when compared to other solution methodologies reported in the literature. [Submitted 31 July 2007; Revised 14 October 2007; Accepted 14 October 2007]

Suggested Citation

  • Sherif A. Fahmy & Tarek Y. ElMekkawy & Subramaniam Balakrishnan, 2008. "Deadlock-free scheduling of flexible job shops with limited capacity buffers," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(3), pages 231-252.
    • Handle: RePEc:ids:eujine:v:2:y:2008:i:3:p:231-252
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=17685
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:eujine:v:2:y:2008:i:3:p:231-252. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.