A review of open queueing network models of manufacturing systems |
| |
| Authors: | Gabriel R Bitran Sriram Dasu |
| |
| Affiliation: | (1) Sloan School of Management, Massachusetts Institute of Technology, 02139 Cambridge, MA, USA;(2) Anderson Graduate School of Management, University of California at Los Angeles, 90024 Los Angeles, CA, USA |
| |
| Abstract: | In this paper we review open queueing network models of manufacturing systems. The paper consists of two parts. In the first part we discuss design and planning problems arising in manufacturing. In doing so we focus on those problems that are best addressed by queueing network models. In the second part of the paper we describe developments in queueing network methodology. We are primarily concerned with features such as general service times, deterministic product routings, and machine failures — features that are prevalent in manufacturing settings. Since these features have eluded exact analysis, approximation procedures have been proposed. In the second part of this paper we review the developments in approximation procedures and highlight the assumptions that underlie these approaches. |
| |
| Keywords: | Open queueing networks job shops approximation procedures parametric decomposition approach optimization Brownian control system design review |
| 本文献已被 SpringerLink 等数据库收录！ |
|
