PROJECTING ON-TIME PERFORMANCE FOR DETERMINISTIC SCHEDULES IN DYNAMIC ENVIRONMENTS

被引:1
|
作者
YELLIG, EJ
MACKULAK, GT
机构
[1] Industrial and Management Systems Engineering Systems Simulation Laboratory Arizona State Univ. Temp
关键词
D O I
10.1016/0360-8352(95)00087-H
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Manufacturing in a world class environment demands a high level of customer service, The production control department is responsible for achieving this high level of service through accurate planning and scheduling, The ability to achieve such a high level of customer service is limited by the scheduling tools currently available. Production planning is typically performed using MRP infinite capacity, fixed lead-time, backward scheduling. The work in each MRP time-bucket is then sequence to develop a schedule. The production floor however, is not a static environment. Dynamic events, that cannot be scheduled, degrade production performance relative to the relationship between dynamic events and schedule degradation is examined. Common approaches to production scheduling underestimate the effect of capacity loading relative to unplanned events and schedule achievability. These dynamic events exhaust capacity previously allocated to production orders. To hedge against such known, but unscheduled events, production control can schedule resources to a level less than full capacity. The size of the capacity hedge and the duration of the unplanned event dictate the time to recover from the backlog created by these dynamic events. A performance metric is developed to measure the ability to achieve customer promise dates. A machine loading policy is also presented to achieve the optimal capacity hedge point that will maximize this performance measure. The results are compared to simulated failures to examine the accuracy of the predicted performance degradation. The results suggest a trade-off of throughput for improved performance to customer promise date.
引用
收藏
页码:291 / 295
页数:5
相关论文
共 50 条
  • [41] Vehicle scheduling based on variable trip times with expected on-time performance
    Shen, Yindong
    Xu, Jia
    Wu, Xianyi
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 99 - 113
  • [42] Deterministic dynamic monitors for linear-time assertions
    Armoni, Roy
    Korchemny, Dmitry
    Tiemeyer, Andreas
    Vardi, Moshe Y.
    Zbar, Yael
    [J]. FORMAL APPROACHES TO SOFTWARE TESTING AND RUNTIME VERIFICATION, 2006, 4262 : 163 - +
  • [43] Deterministic Dynamic Matching in O(1) Update Time
    Sayan Bhattacharya
    Deeparnab Chakrabarty
    Monika Henzinger
    [J]. Algorithmica, 2020, 82 : 1057 - 1080
  • [44] Deterministic Dynamic Matching in O(1) Update Time
    Bhattacharya, Sayan
    Chakrabarty, Deeparnab
    Henzinger, Monika
    [J]. ALGORITHMICA, 2020, 82 (04) : 1057 - 1080
  • [45] Predicting on-time line-haul performance in scheduled railroad operations
    Hallowell, SF
    Harker, PT
    [J]. TRANSPORTATION SCIENCE, 1996, 30 (04) : 364 - 378
  • [46] Social Equity and Bus On-Time Performance in Canada's Largest City
    Palm, Matthew
    Shalaby, Amer
    Farber, Steven
    [J]. TRANSPORTATION RESEARCH RECORD, 2020, 2674 (11) : 329 - 342
  • [47] Predicting on-time line-haul performance in scheduled railroad operations
    Hallowell, S.F.
    Harker, P.T.
    [J]. 1996, Informs, Linthicum, MD, United States (30)
  • [48] Time windows-based team performance measures: A framework to measure team performance in dynamic environments
    Thiruvengada H.
    Rothrock L.
    [J]. Cognition, Technology & Work, 2007, 9 (2) : 99 - 108
  • [49] What is Really "On-Time"? A Comparison of Due Date Performance Indicators in Production
    Schaefer, Ricarda
    Chankov, Stanislav
    Bendul, Julia
    [J]. SIXTH INTERNATIONAL CONFERENCE ON CHANGEABLE, AGILE, RECONFIGURABLE AND VIRTUAL PRODUCTION (CARV2016), 2016, 52 : 124 - 129
  • [50] Dynamic behaviours of constant on-time one-cycle controlled boost converter
    Hu, Wei
    Zhang, Bo
    Yang, Ru
    Qiu, Dongyuan
    [J]. IET POWER ELECTRONICS, 2018, 11 (01) : 160 - 167