• 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.

      Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

      Thumbnail
      View / Download
      211.5 Kb
      Author
      Goren, S.
      Sabuncuoglu, I.
      Koc, U.
      Date
      2012
      Source Title
      Naval Research Logistics
      Print ISSN
      0894-069X
      Publisher
      John Wiley & Sons
       
      1520-6750 (online)
       
      Volume
      59
      Issue
      1
      Pages
      26 - 38
      Language
      English
      Type
      Article
      Item Usage Stats
      126
      views
      143
      downloads
      Abstract
      The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP-hard, even without machine breakdowns; a branch-and-bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance.
      Keywords
      Proactive scheduling
      Branch-and-bound algorithms
      Stability
      Job-Shop scheduling
      Uncertainty
      Permalink
      http://hdl.handle.net/11693/21606
      Published Version (Please cite this version)
      http://dx.doi.org/10.1002/nav.20488
      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