IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/320140.html
   My bibliography  Save this article

A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

Author

Listed:
  • Tao Ren
  • Meiting Guo
  • Lin Lin
  • Yunhui Miao

Abstract

This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

Suggested Citation

  • Tao Ren & Meiting Guo & Lin Lin & Yunhui Miao, 2015. "A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-8, March.
    • Handle: RePEc:hin:jnddns:320140
    DOI: 10.1155/2015/320140
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2015/320140.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2015/320140.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/320140?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
    ---><---

    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:hin:jnddns:320140. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.