IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-55702-1_70.html
   My bibliography  Save this book chapter

Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays

In: Operations Research Proceedings 2016

Author

Listed:
  • Mohamed Amine Mkadem

    (Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc)

  • Aziz Moukrim

    (Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc)

  • Mehdi Serairi

    (Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc)

Abstract

We consider the flow shop problem with two machines and time delays with respect to the makespan, i.e., the maximum completion time. We recall the lower bounds of the literature and we propose new relaxation schemes. Moreover, we investigate a linear programming-based lower bound that includes the implementation of a new dominance rule and a valid inequality. A computational study that was carried out on a set of 480 instances including new hard ones shows that our new relaxation schemes outperform the state of the art lower bounds.

Suggested Citation

  • Mohamed Amine Mkadem & Aziz Moukrim & Mehdi Serairi, 2018. "Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays," Operations Research Proceedings, in: Andreas Fink & Armin Fügenschuh & Martin Josef Geiger (ed.), Operations Research Proceedings 2016, pages 527-533, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-55702-1_70
    DOI: 10.1007/978-3-319-55702-1_70
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Mohamed Amine Mkadem & Aziz Moukrim & Mehdi Serairi, 2021. "Exact method for the two-machine flow-shop problem with time delays," Annals of Operations Research, Springer, vol. 298(1), pages 375-406, March.

    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:spr:oprchp:978-3-319-55702-1_70. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.