IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v51y2000i9d10.1057_palgrave.jors.2600065.html
   My bibliography  Save this article

Minimising maximum lateness in a two-machine flowshop

Author

Listed:
  • M Haouari

    (Ecole Polytechnique de Tunisie, La Marsa)

  • T Ladhari

    (Institut Supérieur de Gestion de Tunis, Le Bardo)

Abstract

The objective of this paper is to develop a branch and bound algorithm for the problem of minimising maximum lateness in a two-machine flowshop, subject to release dates and time lag constraints. The importance of this NP-hard problem is twofold, it arises as a strong relaxation of the classical permutation flowshop problem, and it generalises several well studied two-machine flowshop problems. Computational experiments performed on a large set of randomly generated problems show that our algorithm can solve to optimality large size instances.

Suggested Citation

  • M Haouari & T Ladhari, 2000. "Minimising maximum lateness in a two-machine flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(9), pages 1100-1106, September.
  • Handle: RePEc:pal:jorsoc:v:51:y:2000:i:9:d:10.1057_palgrave.jors.2600065
    DOI: 10.1057/palgrave.jors.2600065
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600065
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2600065?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    2. Chung‐Lun Li & Jinwen Ou, 2005. "Machine scheduling with pickup and delivery," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 617-630, October.

    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:pal:jorsoc:v:51:y:2000:i:9:d:10.1057_palgrave.jors.2600065. 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.palgrave-journals.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.