• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      An efficient algorithm for the single machine total tardiness problem

      Thumbnail
      View / Download
      949.9 Kb
      Author
      Tansel, B. Ç.
      Kara, B. Y.
      Sabuncuoğlu İ.
      Date
      2001
      Source Title
      IIE Transactions (Institute of Industrial Engineers)
      Print ISSN
      0740-817X
      Electronic ISSN
      1545-8830
      Publisher
      Taylor & Francis
      Volume
      33
      Issue
      8
      Pages
      661 - 674
      Language
      English
      Type
      Article
      Item Usage Stats
      136
      views
      114
      downloads
      Abstract
      This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job precedences, a simple optimality check, new decomposition theory, a new lower bound, and a check for presolved subproblems. These are integrated through the use of an equivalenceconcept that permits a continuous reformation of the data to permit early detection of optimality at the nodes of an enumeration tree. The overall effect is a significant reduction in the size of the search tree, CPU times, and storage requirements. The algorithm is capable of handling much larger problems (e.g., 500 jobs) than its predecessors in the literature (:s; 150). In addition, a simple modification of the algorithm gives a new heuristic which significantly outperforms the best known heuristics in the literature.
      Keywords
      Algorithms
      Boundary conditions
      C (programming language)
      Computational complexity
      Computer simulation
      Data structures
      Dynamic programming
      Job analysis
      Theorem proving
      Search tree
      Single machine total tardiness problem
      Scheduling
      Permalink
      http://hdl.handle.net/11693/24828
      Published Version (Please cite this version)
      http://dx.doi.org/10.1023/A:1010931215795
      Collections
      • Department of Industrial Engineering 677
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy