This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We propose a new way of hybridizing iterated local search. It consists in using Branch and Bound algorithm as the embedded local search algorithm inside an iterated local search algorithm. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A nested iterated local search algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times


    Beteiligte:
    Bouabda, R. (Autor:in) / Jarboui, B. (Autor:in) / Rebai, A. (Autor:in)


    Erscheinungsdatum :

    01.05.2011


    Format / Umfang :

    1215252 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Heuristics for single machine scheduling problem with family setup times

    Peng, Yunfang / Han, Yajuan / Xiao, Yuyan et al. | British Library Online Contents | 2017


    Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem

    Varmazyar, M. / Salmasi, N. | British Library Conference Proceedings | 2012


    An Iterated Local Search Algorithm for Agile Earth Observation Satellite Scheduling Problem (AIAA 2018-2311)

    Peng, Guansheng / Vansteenwegen, Pieter / Liu, Xiaolu et al. | British Library Conference Proceedings | 2018


    Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times

    Janardhanan, Mukund Nilakantan / Li, Zixiang / Bocewicz, Grzegorz et al. | BASE | 2019

    Freier Zugriff