In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Solving blocking flowshop scheduling problem with branch and bound algorithm


    Contributors:


    Publication date :

    2013-05-01


    Size :

    953828 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Scheduling for flowshop problem

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



    A branch and bound algorithm for the multiple depot vehicle scheduling problem

    Carpaneto, G. / Dell'Amico, M. / Fischetti, M. et al. | Tema Archive | 1989



    A branch and bound solution method for the crane scheduling problem

    Peterkofsky, Roy I. / Daganzo, Carlos F. | Elsevier | 1989