IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i06ns0217595914500456.html
   My bibliography  Save this article

An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem

Author

Listed:
  • Hongyan Sang

    (State Key Laboratory of Digital Manufacturing Equipment & Technology, Huazhong University of Science & Technology, Wuhan 430074, P. R. China;
    College of Computer Science, Liaocheng University, Liaocheng 252059, P. R. China)

  • Liang Gao

    (State Key Laboratory of Digital Manufacturing Equipment & Technology, Huazhong University of Science & Technology, Wuhan 430074, P. R. China)

  • Xinyu Li

    (State Key Laboratory of Digital Manufacturing Equipment & Technology, Huazhong University of Science & Technology, Wuhan 430074, P. R. China)

Abstract

The lot-streaming flow shop scheduling problem plays an important role in modern industry. This paper addresses this problem with the objective of minimizing the total weighted earliness and tardiness penalties and then proposes a simple but effective iterated local search (ILS) algorithm. In the proposed ILS algorithm, an adapted Nawaz–Enscore–Ham (NEH) heuristic is used to generate an initial solution. A local search procedure based on the insertion neighborhood is employed to perform local exploitation. A simulated-annealing-typed acceptance criterion is utilized to determine the start point for next iteration. Extensive experiments are conducted to compare the proposed ILS algorithm with some existing algorithms. The computational results and comparisons demonstrate the effectiveness of the proposed ILS algorithm.

Suggested Citation

  • Hongyan Sang & Liang Gao & Xinyu Li, 2014. "An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(06), pages 1-19.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:06:n:s0217595914500456
    DOI: 10.1142/S0217595914500456
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500456
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500456?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. Hong-Yan Sang & Quan-Ke Pan & Pei-Yong Duan & Jun-Qing Li, 2018. "An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(6), pages 1337-1349, August.

    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:wsi:apjorx:v:31:y:2014:i:06:n:s0217595914500456. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.