• DocumentCode
    624911
  • Title

    Solving blocking flowshop scheduling problem with branch and bound algorithm

  • Author

    Toumi, Salah ; Jarboui, Bassem ; Eddaly, Mansour ; Rebai, Abdelwaheb

  • Author_Institution
    MODILS Res. Lab., Fac. of Econ. Sci. & Manage. of Sfax, Sfax, Tunisia
  • fYear
    2013
  • fDate
    29-31 May 2013
  • Firstpage
    411
  • Lastpage
    416
  • Abstract
    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.
  • Keywords
    flow shop scheduling; tree searching; blocking flowshop scheduling problem; branch-and-bound algorithm; machine based lower bound; objective function; total completion time; total weighted completion time; Economics; Electronic mail; Job shop scheduling; Linear programming; Processor scheduling; Schedules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advanced Logistics and Transport (ICALT), 2013 International Conference on
  • Conference_Location
    Sousse
  • Print_ISBN
    978-1-4799-0314-6
  • Type

    conf

  • DOI
    10.1109/ICAdLT.2013.6568494
  • Filename
    6568494
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=624911