IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v2y2007i2p135-155.html
   My bibliography  Save this article

The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

Author

Listed:
  • C.T. Ng
  • Ali Allahverdi
  • Fawaz S. Al-Anzi
  • T.C. Edwin Cheng

Abstract

We address the three-machine flowshop scheduling problem to minimise maximum lateness, where setup times are considered separate from processing times. We establish a dominance relation for the problem where it specifies which of the two adjacent jobs should precede in an optimal solution. Moreover, we propose three heuristics: Earliest Due Date (EDD), an Enhanced Earliest Due Date (EEDD) and a Polynomial Genetic-based Algorithm (PGA). We conduct computational analysis on randomly generated problems to evaluate the performance of the proposed heuristics. The analysis shows that the performance of EEDD is acceptable if the computational time is of the main concern and the number of jobs are large. The analysis also shows that PGA significantly outperforms EDD and EEDD.

Suggested Citation

  • C.T. Ng & Ali Allahverdi & Fawaz S. Al-Anzi & T.C. Edwin Cheng, 2007. "The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(2), pages 135-155.
    • Handle: RePEc:ids:ijores:v:2:y:2007:i:2:p:135-155
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=12457
    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:ijores:v:2:y:2007:i:2:p:135-155. 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=170 .

    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.