Queuing approximations for capacity planning under common setup rules

We consider the problem of estimating the resulting utilization and cycle times in manufacturing settings that are subject to significant capacity losses due to setups when switching between different product or part types. In particular, we develop queuing approximations for a multi-item server wit...

Full description

Saved in:
Bibliographic Details
Published inIIE transactions Vol. 53; no. 11; pp. 1177 - 1195
Main Authors Gel, Esma S., Fowler, John W., Khowala, Ketan
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 02.11.2021
Taylor & Francis Ltd
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We consider the problem of estimating the resulting utilization and cycle times in manufacturing settings that are subject to significant capacity losses due to setups when switching between different product or part types. In particular, we develop queuing approximations for a multi-item server with sequence-dependent setups operating under four distinct setup rules that we have determined to be common in such settings: first-in-first-out, setup avoidance, setup minimization and type priority. We first derive expressions for the setup utilization and overall utilization, and use Kingman's well-known approximation to estimate the average cycle time at the station under each setup rule. We test the accuracy of the approximations using a simulation experiment, and provide insights on the use of different setup rules under various conditions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2472-5854
2472-5862
DOI:10.1080/24725854.2020.1815105