IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v65y2014i8p1221-1231.html
   My bibliography  Save this article

A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times

Author

Listed:
  • Hamidreza Eskandari

    (Tarbiat Modares University, Tehran, Iran)

  • Amirhamed Hosseinzadeh

    (Tarbiat Modares University, Tehran, Iran)

Abstract

This paper deals with hybrid flow-shop scheduling problem with rework. In this problem, jobs are inspected at the last stage, and poorly processed jobs were returned and processed again. Thus, a job may visit a stage more than once, and we have a hybrid flow-shop with re-entrant flow. This kind of a shop may occur in many industries, such as final inspection system in automotive manufacturing. The criterion is to minimize the makespan of the system. We developed a 0–1 mixed-integer program of the problem. Since the hybrid flow-shop scheduling problem is NP-hard, an algorithm for finding an optimal solution in polynomial time does not exist. So we generalized some heuristic methods based on several basic dispatching rules and proposed a variable neighbourhood search (VNS) for the problem with sequence-dependent set-up times and unrelated parallel machines. The computational experiments show that VNS provides better solutions than heuristic methods.

Suggested Citation

  • Hamidreza Eskandari & Amirhamed Hosseinzadeh, 2014. "A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(8), pages 1221-1231, August.
    • Handle: RePEc:pal:jorsoc:v:65:y:2014:i:8:p:1221-1231
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v65/n8/pdf/jors201370a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v65/n8/full/jors201370a.html
    File Function: Link to full text HTML
    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.

    Citations

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


    Cited by:

    1. Hongtao Tang & Jiahao Zhou & Yiping Shao & Zhixiong Yang, 2023. "Hybrid Flow-Shop Scheduling Problems with Missing and Re-Entrant Operations Considering Process Scheduling and Production of Energy Consumption," Sustainability, MDPI, vol. 15(10), pages 1-19, May.

    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:pal:jorsoc:v:65:y:2014:i:8:p:1221-1231. 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.