Efficient cycle time-throughput curve generation using a fixed sample size procedure

被引:23
|
作者
Fowler, JW [1 ]
Park, S [1 ]
Mackulak, GT [1 ]
Shunk, DL [1 ]
机构
[1] Arizona State Univ, Dept Ind Engn, Tempe, AZ 85287 USA
关键词
D O I
10.1080/00207540110051879
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The cycle time-throughput curve is one of the most important analytical tools used to assess operating policies in manufacturing systems. Unfortunately, the generation of this curve is complicated and time consuming when generation is based upon extensive simulation analysis. This paper presents a simulation-based, fixed sample size strategy for generating a cycle time-throughput curve with minimal mean square error that mitigates the typical problems associated with a simulation-based cycle time-throughput curve. The strategy comprises two components, the sampling method and sampling weights. A queuing network of five workstations in series is used for validation of the approach. Results indicate that the sampling method using antithetic variates is effective in reducing the variance as well as bias of a cycle time-throughput curve. Furthermore, this method is robust to the sample size. Given a sufficiently large sample, the combination of common random numbers and antithetic variates is preferred. A reduction in the sample size and complexity of the system increases the significance of the sampling weights.
引用
收藏
页码:2595 / 2613
页数:19
相关论文
共 50 条
  • [31] Dealing with small sample size problems in process industry using virtual sample generation: a Kriging-based approach
    Qun-Xiong Zhu
    Zhong-Sheng Chen
    Xiao-Han Zhang
    Abbas Rajabifard
    Yuan Xu
    Yi-Qun Chen
    Soft Computing, 2020, 24 : 6889 - 6902
  • [32] Dealing with small sample size problems in process industry using virtual sample generation: a Kriging-based approach
    Zhu, Qun-Xiong
    Chen, Zhong-Sheng
    Zhang, Xiao-Han
    Rajabifard, Abbas
    Xu, Yuan
    Chen, Yi-Qun
    SOFT COMPUTING, 2020, 24 (09) : 6889 - 6902
  • [33] Sample size determination for a binary response in a superiority clinical trial using a hybrid classical and Bayesian procedure
    Ciarleglio, Maria M.
    Arendt, Christopher D.
    TRIALS, 2017, 18
  • [34] Sample size determination for a binary response in a superiority clinical trial using a hybrid classical and Bayesian procedure
    Maria M. Ciarleglio
    Christopher D. Arendt
    Trials, 18
  • [35] Sample size re-estimation in a superiority clinical trial using a hybrid classical and Bayesian procedure
    Ciarleglio, Maria M.
    Arendt, Christopher D.
    STATISTICAL METHODS IN MEDICAL RESEARCH, 2019, 28 (06) : 1852 - 1878
  • [36] Practical approach to determine sample size for building logistic prediction models using high-throughput data
    Son, Dae-Soon
    Lee, DongHyuk
    Lee, Kyusang
    Jung, Sin-Ho
    Ahn, Taejin
    Lee, Eunjin
    Sohn, Insuk
    Chung, Jongsuk
    Park, Woongyang
    Huh, Nam
    Lee, Jae Won
    JOURNAL OF BIOMEDICAL INFORMATICS, 2015, 53 : 355 - 362
  • [37] Metamodeling for cycle time-throughput-product mix surfaces using progressive model fitting
    Yang, Feng
    Liu, Jingang
    Tongarlak, Mustafa
    Ankenman, Bruce E.
    Nelson, Barry L.
    PROCEEDINGS OF THE 2007 WINTER SIMULATION CONFERENCE, VOLS 1-5, 2007, : 310 - +
  • [38] Throughput Analysis of Manufacturing Systems with Buffers Considering Reliability and Cycle Time Using DES and DOE
    Imseitif, Jad
    Tang, He
    Smith, Mike
    25TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH MANUFACTURING INNOVATION: CYBER PHYSICAL MANUFACTURING, 2019, 39 : 814 - 823
  • [39] Metamodelling for cycle time-throughput-product mix surfaces using progressive model fitting
    Yang, Feng
    Liu, Jingang
    Nelson, Barry L.
    Ankenman, Bruce E.
    Tongarlak, Mustafa
    PRODUCTION PLANNING & CONTROL, 2011, 22 (01) : 50 - 68
  • [40] Sample size calculations for noninferiority trials for time-to-event data using the concept of proportional time
    Phadnis, Milind A.
    Mayo, Matthew S.
    JOURNAL OF APPLIED STATISTICS, 2021, 48 (06) : 1009 - 1032