The robustness of scheduling policies in multi-product manufacturing systems with sequence-dependent setup times and finite buffers

Authors:
Wei Feng;Li Zheng;Jingshan Li
Affiliations:
Department of Industrial Engineering, Tsinghua University, Beijing 100084, China;Department of Industrial Engineering, Tsinghua University, Beijing 100084, China;Department of Industrial and Systems Engineering, 1513 University Avenue, University of Wisconsin, Madison, WI 53706, USA
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 7
Cited 0

Flexible manufacturing systems: a review of analytical models

Management Science
Performance modeling of automated manufacturing systems

Performance modeling of automated manufacturing systems
Manufacturing flow line systems: a review of models and analytical results

Queueing Systems: Theory and Applications - Special issue on queueing models of manufacturing systems
Analysis and Application of Polling Models

Performance Evaluation: Origins and Directions
A survey of manufacturing flexibility: Implications for e-business flexibility

IBM Systems Journal
Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control

Computers and Operations Research
Approximating feeder line reliability statistics with partial data collection in assembly systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.