期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 63, 期 4, 页码 1145-1153出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2012.05.009
关键词
Multi-product; Sequence-dependent setup; Markov chain; Throughput; Scheduling policies; Robustness
资金
- National Natural Science Foundation of China [70771058/60834004]
- 863 Program of China [2008AA04Z102]
- NSF of USA [CMMI-1063656]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1063656] Funding Source: National Science Foundation
In this paper, a continuous time Markov chain model is introduced to study multi-product manufacturing systems with sequence-dependent setup times and finite buffers under seven scheduling policies, i.e., cyclic, shortest queue, shortest processing time, shortest overall time (including setup time and processing times), longest queue, longest processing time, and longest overall time. In manufacturing environments, optimal solution may not be applicable due to uncertainty and variation in system parameters. Therefore, in this paper, in addition to comparing the system throughput under different policies, we introduce the notion of robustness of scheduling policies. Specifically, a policy that can deliver good and stable performance resilient to variations in system parameters (such as buffer sizes, processing rates, and setup times) is viewed as a robust policy. Numerical studies indicate that the cyclic and longest queue policies exhibit robustness in subject to parameter changes. This could provide production engineers a guideline in operation management. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据