Premium
Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
Author(s) -
Goren Selcuk,
Sabuncuoglu Ihsan,
Koc Utku
Publication year - 2012
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20488
Subject(s) - computer science , measure (data warehouse) , stability (learning theory) , schedule , job shop scheduling , mathematical optimization , tabu search , scheduling (production processes) , job shop , point (geometry) , time point , term (time) , flow shop scheduling , algorithm , machine learning , mathematics , data mining , physics , quantum mechanics , philosophy , geometry , aesthetics , operating system
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. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011