Abstract
Frequently, modern systems of production management are characterized by a hierarchical structure: Decisions on a higher level set targets to be considered by production planning and carried out by production control on subordinate levels. Setting targets on the superior level requires information about the performance, such as net capacities available on the subordinate level. As its performance depends on inventory planning and scheduling, decisions on the subordinate level which, in turn, depend on the targets to be fulfilled, this information is not available for planning on the superior level. Capacities available and other measures of performance may, however, be derived using appropriate mathematical models of the planning process.
In this paper, several queueing theoretical approaches estimating the capacity and the throughput of subordinate manufacturing units in a hierarchical production planning surrounding are presented. Considering the assumptions necessary to find operable solutions, e.g. appropriate Markovian properties, it can be shown that models of open and closed queueing networks may be applied in the case of single item manufacturing and production of small batches. Whereas hybrid approach with a continuous flow of production and rates switching according to a semi-Markov process may be applied in the case of large batches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Bailey NTJ (1954) On Queuing Processes with Bulk Service. J. Roy. Stat.Soc. Ser. B 16:80–87
Barrer DY (1957) Queuing with Impatient Customers and Indifferent Clerks, OR 5:644–649
Bruell StC, Balbo G (1980) Computational Algorithms for Closed Queueing Networks. Elsevier North Holland, New York
Burke PJ (1956) The Output of a Queuing System. OR 4:699–704
Buzacott, JA, Shantikumar JG (1985) On Approximate Models of Dynamic Job Shops. MS 31:870–887
Buzen JP (1973) Computational Algorithms for Closed Queueing Networks with Exponential Servers. CACM 16:527–531
Cobham A (1954) Priority Assignment in Waiting Line Problems. OR 2:70–76
de Koster MBM (1989) Capacity Orientated Analysis and Design of Production Systems. Springer, Berlin-Heidelberg
Denning PJ, Buzen JP (1978) The Operational Analysis of Queueing Networks. Computing Surveys 10:225–261
Disney Rl, Kiessler, PC (1987) Traffic Processes in Queueing Networks, John Hopkins Univ. Press, Baltimore
Ferschl F (1961) Warteschlangen mit gruppiertem Input. Ufo 5:185–196
Ferschl F (1964) Zufallsabhängige Wirtschaftsprozesse. Grundlagen und Theorie der Wartesysteme. Physica, Würzburg Wien
Gaver DP (1959) Imbedded Markov Chain Analysis of Waiting Line Processes in Continuous Time. Ann.Math.Stat 30:698–720
Gaver DP (1962) A Waiting Line With Interrupted Services, Including Priorities. J.Roy.Stat. Soc.Ser. B24:73–90
Gnedenko BW, König D (1983/84) Handbuch der Bedienungstheorie, 2 Bde. Akademie-Verlag, Berlin (Ost)
Gordon WJ, Newell GF (1967) Closed Queuing Systems with Exponential Servers. OR 15: 254–265
Hax AC, Meal HC (1975) Hierarchical Integration of Production Planning and Scheduling. In: Geisler MA (Hrsg) Logistics, TIMS Studies in the Management Sciences. North Holland, Amsterdam: 53–69
Hunt GC (1956) Sequential Arrays of Waiting Lines. OR 4:674–683
Jackson JR (1957) Networks of Waiting Lines. OR 5:518–521
Jackson JR (1965) Jobshop-like Queueing Systems MS 10:131–142
Jaiswal, NK (1968) Priority Queues. Academic Press, New York
Keilson J, Kooharian A (1960), On Time Dependent Queuing Processes. Ann.Math.Stat. 31:104–112
Kendall DG (1951) Some Problems in the Theory of Queues. J.Roy. Stat. Soc. Ser. B 13:151–173
Kendall DG (1953) Stochastic Processes Occurring in the Theory of Queues and Their Analysis by the Method of Imbedded Markov Chain. Ann.Math.Stat. 24:338–354
Kistner K-P (1974) Wartesysteme mit Betriebsstörungen. Westdeutscher Verlag, Opladen
Kistner K-P (1987) Warteschlangentheorie. In: Gal T (Hrsg) Grundlagen des Operations Research, Bd. 3. Springer, Berlin Heidelberg New York: 253–289
Kistner K-P, Switalski M (1988) Produktionstypen und die Struktur des Produktionsprozesses. WISU 17332:337
Kistner K-P, Steven/Switalski M (1990a) Warteschlangen-Netzwerke in der hierarchischen Produktionsplanung. OR Spektrum 12:89–101
Kistner K-P, Steven M (1990b) Warteschlangennetzwerke in hierarchischen Planungssystemen. Komplexe Systeme und Qualität, Sonderheft 55 der Wissenschaftlichen Zeitschrift der Hochschule für Verkehrswesen “Friedrich List” Dresden: 108–122
Lindley DV (1952) The Theory of Queues with a Single Server. Proc. Cambridge Phil.Soc 48:277–289
Little JDC (1961) A Proof of the Queueing Formula L = W. OR 9:383–387
Morse P (1959) Queues, Inventories, and Maintenance. J. Wiley, New York
Palm C (1947) Arbetskraftnes Ferdelning Vid Baljaning av Automaskener Industidningen. Norden 75:75–80 und 119-123; Engl. Transi. The Distribution of Repairmen in Servicing Automatic Machines. J. Ind. Engin. 9 (1958):28-42.
Solberg JJ (1977) A Mathematical Model of Computing Manufacturing Systems. Proceedings of the Fourth International Conference on Production Research, Tokio: 1265–1275
Srinivasan SK (1974) Stochastic Point Processes and Their Applications. Griffin, London
Srinivasan SK, Subramanian R (1980) Probabilistic Analysis of Redundant Systems. Springer, Berlin-Heidelberg
Suri R, Hildebrant RR (1984) Modelling Flexible Manufacturing Systems using Mean-Value Analysis. J of Manufacturing 3:27–38
Switalski M, Kistner K-P (1988) Produktionstypen und die Struktur des Produktionsprozesses. WISU 17:332–337
Tempelmeier H (1988) Kapazitätsplanung für flexible Fertigungssysteme. ZfB 58:963-980 Thiruvengadam K (1963) Queuing with Breakdowns. OR 11:62–71
White H und Christie LS (1958) Queuing with Preemptive Priorities or with Breakdown. OR 6:79–95
Wijngaard J (1979) The Effect of Interstage Buffer Storage on the Output of Two Unreliable Production Units in Series, with Different Production Rates, AIIE Transactions 11:1979
Yao DD, Buzacott JA (1986) Models of Flexible Manufacturing Systems with Limited Local Buffer, Intern J Prod Res 24:107–118
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kistner, KP. (1991). Queueing Models in Hierachical Planning Systems. In: Beckmann, M.J., Gopalan, M.N., Subramanian, R. (eds) Stochastic Processes and their Applications. Lecture Notes in Economics and Mathematical Systems, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58201-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-58201-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54635-1
Online ISBN: 978-3-642-58201-1
eBook Packages: Springer Book Archive