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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving blocking flowshop scheduling problem with branch and bound algorithm


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


    Erscheinungsdatum :

    01.05.2013


    Format / Umfang :

    953828 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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 Archiv | 1989



    A branch and bound solution method for the crane scheduling problem

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