By Topic

Analysis of queueing networks with population constraints and applications to manufacturing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Baynat ; Lab. MASI, CNRS, Univ. Pierre et Marie Curie, Paris, France ; Y. Dallery

The authors consider closed queuing networks with general service times and subnetworks having population constraints. Each such subnetwork consist of a subset of stations of the original network. The population constraint of a subnetwork prescribes that the total number of customers than can be simultaneously present inside the subnetwork is limited to a fixed value, called the capacity of the subnetwork. A customer wanting to enter a subnetwork while it is full must wait in an external queue. As soon as a customer leaves the subnetwork, the first customer in line is allowed to enter the subnetwork. Such queuing networks with population constraints are of interest for modeling and analysis of manufacturing systems. Two approximate techniques for analyzing such networks, namely the aggregation technique and the method of R. Marie (1979, 1980), are compared

Published in:

Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on

Date of Conference:

12-14 May 1992