• 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 anticipative scheduling approach with controllable processing times

      Thumbnail
      View / Download
      255.4 Kb
      Author
      Gürel, S.
      Körpeoǧlu, E.
      Aktürk, M. S.
      Date
      2010
      Source Title
      Computers & Operations Research
      Print ISSN
      0305-0548
      Electronic ISSN
      1873-765X
      Publisher
      Elsevier
      Volume
      37
      Issue
      6
      Pages
      1002 - 1013
      Language
      English
      Type
      Article
      Item Usage Stats
      109
      views
      107
      downloads
      Abstract
      In practice, machine schedules are usually subject to disruptions which have to be repaired by reactive scheduling decisions. The most popular predictive approach in project management and machine scheduling literature is to leave idle times (time buffers) in schedules in coping with disruptions, i.e. the resources will be under-utilized. Therefore, preparing initial schedules by considering possible disruption times along with rescheduling objectives is critical for the performance of rescheduling decisions. In this paper, we show that if the processing times are controllable then an anticipative approach can be used to form an initial schedule so that the limited capacity of the production resources are utilized more effectively. To illustrate the anticipative scheduling idea, we consider a non-identical parallel machining environment, where processing times can be controlled at a certain compression cost. When there is a disruption during the execution of the initial schedule, a match-up time strategy is utilized such that a repaired schedule has to catch-up initial schedule at some point in future. This requires changing machine-job assignments and processing times for the rest of the schedule which implies increased manufacturing costs. We show that making anticipative job sequencing decisions, based on failure and repair time distributions and flexibility of jobs, one can repair schedules by incurring less manufacturing cost. Our computational results show that the match-up time strategy is very sensitive to initial schedule and the proposed anticipative scheduling algorithm can be very helpful to reduce rescheduling costs.
      Keywords
      Anticipative scheduling
      Controllable processing times
      Reactive scheduling
      Match-up time
      Permalink
      http://hdl.handle.net/11693/22304
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2009.09.001
      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