• Title of article

    The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm

  • Author/Authors

    Can Akkan، نويسنده , , Selcuk Karabati، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    10
  • From page
    420
  • To page
    429
  • Keywords
    Branch-and-bound , Lagrangean relaxation , flowshop scheduling
  • Journal title
    European Journal of Operational Research
  • Serial Year
    2004
  • Journal title
    European Journal of Operational Research
  • Record number

    215143

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=215143