Effectiveness of Definite Schedule Optimization under Processing Time Variability : Experimental Analysis of Job Shop Scheduling

DOI Web Site 10 References

Bibliographic Information

Other Title
  • 作業時間に変動を伴う場合の確定的スケジュール最適化の有効性 : ジョブショップスケジューリングにおける実験的分析
  • 作業時間に変化を伴う場合の確定的スケジュール最適化の有効性--ジョブショップスケジューリングにおける実験的分析
  • サギョウ ジカン ニ ヘンカ オ トモナウ バアイ ノ カクテイテキ スケジュ

Search this article

Description

The scheduling problem is often treated as a combinatorial optimization problem based on the definite processing time. In real production systems, however, the processing time is not always definite. In this paper, assuming that a shop is operated on a schedule sequence predetermined based on estimated processing times, the actual required-time performance of a schedule which is optimal with respect to the estimated processing times, is analyzed under the condition that the actual processing times fluctuate randomly around the estimated values. Extensive experimental results show that 1) finding and following the optimal or near-optimal schedule with respect to estimated times is meaningful enough, to justify the schedule optimization, 2) even though the variability of processing times increases, the relative precision performance of schedules can deteriorate only a littel linearly, whereas the associated precision worsens very quickly.

Journal

References(10)*help

See more

Details 詳細情報について

Report a problem

Back to top