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

Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria

Author

Listed:
  • Saïd Toumi
  • Bassem Jarboui
  • Mansour Eddaly
  • Abdelwaheb Rebaï

Abstract

This paper addresses the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimise the total tardiness and total weighted tardiness with a branch and bound algorithm. New machine-based lower bound was developed for the problem. The experimental results on both criteria have shown the efficiency of the proposed algorithm both in terms of solutions quality and time requirements.

Suggested Citation

  • Saïd Toumi & Bassem Jarboui & Mansour Eddaly & Abdelwaheb Rebaï, 2017. "Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(4), pages 441-459.
    • Handle: RePEc:ids:ijores:v:30:y:2017:i:4:p:441-459
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87825
    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:30:y:2017:i:4:p:441-459. 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.