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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2013-05-01


    Size :

    922689 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    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