Scheduling in a production workshop consists of assigning a number of different tasks to the existing machines with respect to the constraints of the problem in order to optimise the objective function. In this paper, we focus on the No-Wait Flow Shop Scheduling Problem (NWFSSP) with the makespan objective. We present a new hybrid algorithm NEW-GRASP-DE that combines Greedy Randomised Adaptive Search Procedure (GRASP) with Differential Evolution Algorithm (DEA). Furthermore, we used an Iterative Local Search (ILS) as an improvement phase in the GRASP method. Our algorithm is tested on instances that have been proposed in the literature. We compared our results with those of different authors. The experimental results show the effectiveness of our algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem


    Beteiligte:
    Akrout, Hanen (Autor:in) / Jarboui, Bassem (Autor:in) / Rebai, Abdelwaheb (Autor:in) / Siarry, Patrick (Autor:in)


    Erscheinungsdatum :

    2013-05-01


    Format / Umfang :

    298601 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Solving blocking flowshop scheduling problem with branch and bound algorithm

    Toumi, Said / Jarboui, Bassem / Eddaly, Mansour et al. | IEEE | 2013


    Scheduling for flowshop problem

    Happiette, M. / Zeng, X. | British Library Online Contents | 1995


    The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution

    Lee, Der-Horng / Chen, Jiang Hang / Cao, Jin Xin | Elsevier | 2010



    Traffic Signal Optimization with Greedy Randomized Tabu Search Algorithm

    Hu, T.-Y. / Chen, L.-W. | British Library Online Contents | 2012