• About
  • Policies
  • What is open access
  • 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 analysis of heuristics in a dynamic job shop with weighted tardiness objectives

      Thumbnail
      View / Download
      438.2 Kb
      Author(s)
      Kutanoglu, E.
      Sabuncuoğlu, İ.
      Date
      1999
      Source Title
      International Journal of Production Research
      Print ISSN
      0020-7543
      Publisher
      Taylor & Francis
      Volume
      37
      Issue
      1
      Pages
      165 - 187
      Language
      English
      Type
      Article
      Item Usage Stats
      203
      views
      246
      downloads
      Abstract
      Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive literature survey on the topic, we measure the long-run performances of more than 20 single-pass dispatching rules under various experimental conditions. In this study, we pay special attention to recently proposed dispatching heuristics such as CEXSPT, CR+ SPT, S/RPT+ SPT, and Bottleneck Dynamics (BD). We also investigate the effects of six resource pricing schemes proposed recently for BD. Moreover, we extend the earlier versions of inserted idleness and identify the conditions in which these techniques can be applied without incurring too much computational cost. Future research directions are also outlined in light of the computational results. © 1999 Taylor & Francis Ltd.
      Keywords
      Computational complexity
      Heuristic methods
      Problem solving
      Bottleneck Dynamics (BD)
      Dispatching heuristics
      Dynamic job shop scheduling
      Weighted tardiness criterion
      Production control
      Permalink
      http://hdl.handle.net/11693/25142
      Published Version (Please cite this version)
      https://doi.org/10.1080/002075499191995
      Collections
      • Department of Industrial Engineering 733
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      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 2976
      © Bilkent University - Library IT

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