IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i2p338-356.html
   My bibliography  Save this article

Scheduling flow shops with operators

Author

Listed:
  • Imène Benkalai
  • Djamal Rebaine
  • Pierre Baptiste

Abstract

This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines. We present complexity results and develop a new lower bound. Heuristic algorithms are designed for both problems. An experimental study is then conducted to evaluate the quality of our solving methods. The results show that the appropriate approach depends on the parameters of the problem, including the number of operators. The methods also provided results close to the theoretical lower bound in most of the cases.

Suggested Citation

  • Imène Benkalai & Djamal Rebaine & Pierre Baptiste, 2019. "Scheduling flow shops with operators," International Journal of Production Research, Taylor & Francis Journals, vol. 57(2), pages 338-356, January.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:2:p:338-356
    DOI: 10.1080/00207543.2018.1425557
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1425557
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1425557?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:57:y:2019:i:2:p:338-356. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.