IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v5y2003i1-2p1-9.html
   My bibliography  Save this article

Robustness optimisation of the minimum makespan schedules in a job shop

Author

Listed:
  • Yuuki Kawata, Katsumi Morikawa, Katsuhiko Takahashi, Nobuto Nakamura

Abstract

In general, many minimum makespan schedules exist in job shops. Therefore, it is important to select the best one based on secondary criterion. In this paper, we adopt a measure called robustness of the schedule as the selection criterion. The robustness of the schedule is the maximum value of the sensitivity, which is a measure for the delay of completion times by one time unit, for all of the operations. As there are generally many minimum makespan schedules, it is difficult to enumerate all makespan-minimum active schedules and then to find the most robust schedule. A branch and bound method is introduced to the minimisation of makespan while optimising robustness based on a disjunctive graph model and the propositions proposed by Carlier and Pinson. A lower bound of robustness for each partial schedule is calculated using the corresponding disjunctive graph. The effectiveness of the proposed approach is clarified by solving test problems.

Suggested Citation

  • Yuuki Kawata, Katsumi Morikawa, Katsuhiko Takahashi, Nobuto Nakamura, 2003. "Robustness optimisation of the minimum makespan schedules in a job shop," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 5(1/2), pages 1-9.
    • Handle: RePEc:ids:ijmtma:v:5:y:2003:i:1/2:p:1-9
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=2524
    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:ijmtma:v:5:y:2003:i:1/2:p:1-9. 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=21 .

    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.