IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v2y2008i3p279-297.html
   My bibliography  Save this article

A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems

Author

Listed:
  • Quan-Ke Pan
  • Ling Wang

Abstract

A novel Discrete Differential Evolution (DDE) algorithm is proposed in this paper for solving no-idle permutation flow-shop scheduling problems with maximum completion time (makespan) criterion. Firstly, individuals of the DDE algorithm are represented as discrete job permutations, and new mutation and crossover operators are developed. Secondly, a local search algorithm based on insert neighbourhood is embedded in the DDE algorithm to balance the exploration and exploitation and to enhance the local searching ability. In addition, we present two simple approaches to calculate makespan and a speed-up method for insert neighbourhood to improve the efficiency of the whole algorithm. Computational simulations and comparisons based on some well-known benchmarks demonstrate that the DDE algorithm is not only superior to the improved greedy and Kalczynski-Kamburowski heuristics in terms of searching quality, but also superior to the particle swarm optimisation and differential evolution algorithms according to searching quality, robustness and efficiency. [Received 9 July 2007; Revised 10 October 2007; Accepted 30 October 2007]

Suggested Citation

  • Quan-Ke Pan & Ling Wang, 2008. "A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(3), pages 279-297.
    • Handle: RePEc:ids:eujine:v:2:y:2008:i:3:p:279-297
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=17687
    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. Zewen Sun & Xingsheng Gu, 2017. "Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization," Sustainability, MDPI, vol. 9(6), pages 1-16, June.
    2. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    3. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    4. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    5. Tolga Bektaş & Alper Hamzadayı & Rubén Ruiz, 2020. "Benders decomposition for the mixed no-idle permutation flowshop scheduling problem," Journal of Scheduling, Springer, vol. 23(4), pages 513-523, August.
    6. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    7. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.

    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:ids:eujine:v:2:y:2008:i:3:p:279-297. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.