Interêt de la théorie des réseaux de files d’attente pour l’évaluation des performances d’un atelier flexible. (French) Zbl 0545.90053

Cavaille, J. B.; Dubois, D.

Analysis and optimization of systems, Proc. 5th int. Conf., Versailles 1982, Lect. Notes Control Inf. Sci. 44, 320-331 (1982).

Summary: [For the entire collection see Zbl 0539.00031.]
The relevance of queueing network algorithms for performance evaluation of flexible manufacturing systems is analyzed. A review of results in queueing network theory likely to be useful in the context of manufacturing systems is proposed. The emphasis is put on the limitation of these methods whose assumptions are sometimes irrealistic. Their usefulness stems from their computational efficiency, which makes them more attractive than burdensome simulation methods, at the first stages of the FMS design process. Queueing networks methods basically provide qualitative results which make a comparison of manufacturing configurations from the point of view of the production capacity possible.

MSC:

90B30	Production models
90B10	Deterministic network models in operations research
60K20	Applications of Markov renewal processes (reliability, queueing networks, etc.)
90B22	Queues and service in operations research
65K05	Numerical mathematical programming methods

Keywords:

queueing network algorithms; performance evaluation; flexible manufacturing systems

Citations:

Zbl 0539.00031