• DocumentCode
    481341
  • Title

    New lower bound for single machine total tardiness problem with sequence dependent setup

  • Author

    Luo, Xiaochuan ; Li, Dancheng ; Song, Hang ; Cui, Dongliang

  • Author_Institution
    Key Laboratory of Process Industry Automation of MOE, Northeastern University, Shenyang 110004, China
  • fYear
    2006
  • fDate
    6-7 Nov. 2006
  • Firstpage
    1455
  • Lastpage
    1458
  • Abstract
    A new Lower bound is present for the NP-hard problem of scheduling N jobs on a single machine with due dates, sequence-dependent setup times, and no preemption where the objective is to minimize the total tardiness. One branch-and-bound algorithm with the new lower bound is developed to demonstrate the effectiveness of lower bound. A comparison with Ragatz’s B&B approaches indicates that the lower bound is competitive.
  • Keywords
    Lower bound; branch and bound; sequence-dependent setup; single machine schedule; total tardiness;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Technology and Innovation Conference, 2006. ITIC 2006. International
  • Conference_Location
    Hangzhou
  • ISSN
    0537-9989
  • Print_ISBN
    0-86341-696-9
  • Type

    conf

  • Filename
    4752233
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=481341