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

Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability

Author

Listed:
  • M-L Espinouse

    (LOSI, Université de Technologie de Troyes)

  • P Formanowicz

    (Poznań University of Technology)

  • B Penz

    (GILCO, ENSGI-INPG)

Abstract

The scheduling problems studied in this paper concern a two-machine no-wait flow shop problem with limited machine availability. In this model, we assume that machines may not always be available, for example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in advance. The objective function considered is the maximum completion time (Cmax). We prove that the problem is NP-hard even if only one non-availability period occurs on one of machines, and NP-hard in the strong sense for arbitrary numbers of non-availability periods. We also provide heuristic algorithms with error bounding analysis.

Suggested Citation

  • M-L Espinouse & P Formanowicz & B Penz, 2001. "Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(1), pages 116-121, January.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:1:d:10.1057_palgrave.jors.2601025
    DOI: 10.1057/palgrave.jors.2601025
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601025
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601025?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. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    2. Mikhail A. Kubzin & Vitaly A. Strusevich, 2004. "Two‐machine flow shop no‐wait scheduling with a nonavailability interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 613-631, June.
    3. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    4. Abdelhamid Boudjelida, 2019. "On the robustness of joint production and maintenance scheduling in presence of uncertainties," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1515-1530, April.

    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:52:y:2001:i:1:d:10.1057_palgrave.jors.2601025. 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.