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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2013-05-01


    Size :

    298601 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Solving blocking flowshop scheduling problem with branch and bound algorithm

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


    Quantum Glowworm Swarm Algorithm and Its Application to No-wait Flowshop Scheduling

    Qi, Xuemei / Wang, Hongtao / Yang, Jie et al. | British Library Online Contents | 2016


    Scheduling for flowshop problem

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



    Traffic Signal Optimization with Greedy Randomized Tabu Search Algorithm

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