This paper proposes new machine based lower bounds for scheduling the flowshop with blocking constraints problem while minimizing the total tardiness and total weighted tardiness. Some characteristics of the developed branch and bound algorithm are discussed and computational experiments on several random instances are presented. The obtained results compare favorably with previous works in the litterature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Lower bounds on the total tardiness and total weighted tardiness for scheduling flowshop with blocking


    Beteiligte:
    Toumi, Said (Autor:in) / Jarboui, Bassem (Autor:in) / Eddaly, Mansour (Autor:in) / Rebai, Abdelwaheb (Autor:in)


    Erscheinungsdatum :

    01.05.2013


    Format / Umfang :

    922689 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Scheduling with earliness and tardiness penalties

    Ferris, Michael C. / Vlach, Milan | TIBKAT | 1990


    NEH-based heuristics for the distributed permutation flowshop with rejection and tardiness

    Lin, Zhen / Jia, Bao-Xian / Jing, Xue-Lei | British Library Conference Proceedings | 2023


    Minimizing Total Tardiness on Parallel Machines Based on Genetic Algorithms

    Wang, C.-y. / Zhao, D.-y. / Xiao, J.-g. | British Library Online Contents | 2003