• DocumentCode
    614791
  • Title

    An efficient branch and bound algorithm to solve the permutation flowshop scheduling problem with blocking constraints

  • Author

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

  • Author_Institution
    Res. Lab.: MODILS, Fac. of Econ. Sci. & Manage. of Sfax, Sfax, Tunisia
  • fYear
    2013
  • fDate
    28-30 April 2013
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We consider the m machine blocking flowshop scheduling problem. The objective is to obtain a feasible solution that minimizes the total tardiness criterion. We derive new machine based lower bound for this problem. Favorable experimental results are reported on an extensive set of problem instances.
  • Keywords
    flow shop scheduling; tree searching; blocking constraints; branch and bound algorithm; m machine blocking flowshop scheduling problem; machine based lower bound; permutation flowshop scheduling problem; total tardiness criterion minimization; Approximation algorithms; Economics; Electronic mail; Equations; Face; Heuristic algorithms; Scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on
  • Conference_Location
    Hammamet
  • Print_ISBN
    978-1-4673-5812-5
  • Type

    conf

  • DOI
    10.1109/ICMSAO.2013.6552616
  • Filename
    6552616
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=614791