Literaturverzeichnis - link.springer.com978-3-658-24246-6/1.pdf · blocking before service. Performance Evaluation 10, – Gaver, D. P. (1962). A waiting line with interrupted service,

Literaturverzeichnis

Akyıldız, I. F. (1987). Exact product form solutions for queueing networkswith blocking. IEEE Transactions on Computers 1, 121–126.

Akyıldız, I. F. (1988a). General closed queueing networks with blocking. In:P.-J. Courtois und G. Latouche (Hrsg.), Performance ’87, Proceeding ofthe 12th IFIP WG 7.3 International Symposium on Computer PerformanceModelling, Measurement and Evaluation, Brussels, Belgium, 7–9 December1987. Amsterdam: Elsevier Science Publishers (North-Holland). S. 283–303.Universite Libre de Bruxelles, Philips Research Laboratory, Brussels.

Akyıldız, I. F. (1988b). On the exact and approximate throughput analysisof closed queueing networks with blocking. IEEE Transactions on SoftwareEngineering 14 (1), 62–70.

Allen, A. O. (1990). Probability, Statistics, and Queueing Theory — WithComputer Science Application (2. Aufl.). Computer Science and ScientificComputing. San Diego: Academic Press.

Altıok, T. M. (1997). Performance Analysis of Manufacturing Systems.Springer Series in Operations Research. New York: Springer.

Altıok, T. M., und R. Ranjan (1989). Analysis of production lines withgeneral service times and finite buffers: A two-node decomposition approach.Engineering Cost and Production Economics 17, 155–156.

269

© Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature 2005M. Manitz, Leistungsanalyse von Montagesystemen mit stochastischenBearbeitungszeiten, Edition KWV, https://doi.org/10.1007/978-3-658-24246-6

270 LITERATURVERZEICHNIS

Altıok, T. M., und S. Stidham Jr. (1982). A note on transfer lines withunreliable machines, random processing times, and finite buffers. IIE Tran-sactions 14 (2), 125–127.

Ammar, M. H., und S. B. Gershwin (1989). Equivalence relations in queueingmodels of fork/join networks with blocking. Performance Evaluation 10,233–245.

Arnold, D., H. Isermann, A. Kuhn und H. Tempelmeier (Hrsg.) (2002).Handbuch Logistik, VDI-Buch. Abschnitt Konfigurationsplanung bei Fließ-produktion (von S. Helber). Berlin, Heidelberg: Springer.

Balsamo, S., V. De Nitto Persone und R. Onvural (2001). Analysisof Queueing Networks with Blocking. Boston, Dordrecht, London: KluwerAcademic Publishers.

Baskett, F., K. M. Chandy, R. R. Muntz und F. G. Palacios (1975).Open, closed, and mixed networks of queues with different classes of custo-mers. Journal of the Association for Computing Machinery 22 (2), 248–260.

Behrens, W., und W. Delfmann (1994). Quantitative Planung — Konzep-tion, Methoden und Anwendungen. Stuttgart: Schaffer-Poeschel.

Bhat, U. N. (1986). Finite capacity assembly-like queues. Queueing Systems 1,85–101.

Bock, S. (2000). Modelle und verteilte Algorithmen zur Planung getakte-ter Fließlinien — Ansatze zur Unterstutzung eines effizienten Mass Custo-mization. Schriften zur quantitativen Betriebswirtschaftslehre. Wiesbaden:Gabler und Deutscher Universitatsverlag.

Bolch, G. (1989). Leistungsbewertung von Rechensystemen mittels analyti-scher Warteschlangenmodelle. Leitfaden und Monographien der Informatik.Stuttgart: Teubner.

Bonomi, F. (1987). An approximate analysis for a class of assembly-likequeues. Queueing Systems 1, 289–309.

LITERATURVERZEICHNIS 271

Burger, M. (1997). Konfigurationsplanung flexibler Fließproduktionssysteme.Glienicke/Berlin: Galda und Wilch. (zugl. Diss. Universitat zu Koln, 1997).

Burman, M. H. (1995). New Results in Flow Line Analysis. Ph. D. thesis,Massachusetts Institute of Technology.

Buzacott, J. A. (1967). Automatic transfer lines with buffer stocks. Inter-national Journal of Production Research 3 (3), 183–200.

Buzacott, J. A. (1972). The effect of station breakdowns and random pro-cessing times on the capacity of flow lines with in-process storage. AIIETransactions 4 (4), 308–312.

Buzacott, J. A., und L. E. Hanifin (1978). Models of automatic transferlines with inventory banks — a review and comparison. AIIE Transacti-ons 10 (2), 197–207.

Buzacott, J. A., und D. Kostelski (1987). Matrix-geometric and recur-sive algorithm solution of a two-stage unreliable flow line. IIE Transacti-ons 19 (4), 429–438.

Buzacott, J. A., X.-G. Liu und J. G. Shanthikumar (1995). Multistageflow line analysis with the stopped arrival queue model. IIE Transactions 27,444–455.

Buzacott, J. A., und J. G. Shanthikumar (1993). Stochastic Models ofManufacturing Systems. Englewood Cliffs: Prentice-Hall.

Carrascosa, M. (1995, Mai). Variance of the output in a deterministic two-machine line. Master thesis, Laboratory for Manufacturing and Producti-vity, Massachusetts Institute of Technology, Cambridge. ForschungsberichtLMP-95-010.

Choong, Y. F., und S. B. Gershwin (1987). A decomposition method forthe approximate evaluation of capacitated transfer lines with unreliable ma-chines and random processing times. IIE Transactions 19 (2), 150–159.


Chow, W.-M. (1987). Buffer capacity analysis for sequential production li-nes with variable process times. International Journal of Production Rese-arch 25 (8), 1183–1196.

Commault, C., und A. Semery (1990). Taking into account delays in buf-fers for analytical performance evaluation of transfer lines. IIE Transacti-ons 22 (2), 133–142.

Cox, D. R. (1955). A use of complex probabilities in the theory of stochasticprocesses. In: Proceedings of the Cambridge Philosophical Society, Band 51.Cambridge Philosophical Society.

Dallery, Y., R. David und X.-L. Xie (1988). An effincient algorithm foranalysis of transfer lines with unreliable machines and finite buffers. IIETransactions 20 (3), 280–283.

Dallery, Y., R. David und X.-L. Xie (1989). Approximate analysis of trans-fer lines with unreliable machines and finite buffers. IEEE Transactions onAutomatic Control 34 (9), 943–953.

Dallery, Y., und Y. Frein (1993). On decomposition methods for tandemqueueing networks with blocking. Operations Research 41 (2).

Dallery, Y., und S. B. Gershwin (1992). Manufacturing flow line systems— a review of models and analytical results. Queueing Theory 12, 3–94.

Dallery, Y., Z. Liu und D. Towsley (1994). Equivalence, reversibility, sym-metry and concavity properties in fork-join queueing networks with blocking.Journal of the Association for Computing Machinery 41 (5), 903–942.

Dallery, Y., Z. Liu und D. Towsley (1997). Properties of fork/join queu-eing networks with blocking under various operating mechanisms. IEEETransactions on Robotics and Automation 13 (4), 503–518.

Di Mascolo, M., R. David und Y. Dallery (1991). Modeling and ana-lysis of assembly systems with unreliable machines and finite buffers. IIETransactions 23 (4), 315–330.


Domschke, W., R. Klein und A. Scholl (1996). Antizipative Leistungs-abstimmung bei moderner Variantenfließfertigung. Zeitschrift fur Betriebs-wirtschaft 66 (12), 1465–1491.

Domschke, W., A. Scholl und S. Voß (1997). Produktionsplanung —Ablauforganisatorische Aspekte (2. Aufl.). Berlin, Heidelberg, New York:Springer.

Drexl, A., und C. Jordan (1995). Materialflußorientierte Produktionssteue-rung bei Variantenfließfertigung. Zeitschrift fur betriebswirtschaftliche For-schung 47 (12), 1073–1087.

Drexl, A., und A. Kimms (2001). Sequencing JIT mixed-model assembly linesunder station-load and part-usage constraints. Management Science 47 (3),480–491.

Dudley, N. A. (1968). Work Measurement: Some Research Studies. Studiesin Management. London: Macmillan.

Duenyas, I. (1994). Estimating the throughput of a cyclic assembly system.International Journal of Production Research 32 (6), 1403–1419.

Duenyas, I., und W. J. Hopp (1992). CONWIP assembly with deterministicprocessing and random outages. IIE Transactions 24 (4), 97–109.

Duenyas, I., und W. J. Hopp (1993). Estimating the throughput of an ex-ponential CONWIP assembly system. Queueing Systems 14, 135–157.

Frein, Y., und Y. Dallery (1989). Analysis of cyclic queueing networks withblocking before service. Performance Evaluation 10, 197–210.

Gaver, D. P. (1962). A waiting line with interrupted service, including prio-rities. Journal of the Royal Statistical Society 24 (2), 73–90.

Gershwin, S. B. (1987). An efficient decomposition method for the appro-ximate evaluation of tandem queues with finite storage space and blocking.Operations Research 35 (2), 291–305.


Gershwin, S. B. (1989). An efficient decomposition algorithm for the unre-liable tandem queueing systems with finite buffers. In: H. G. Perros undT. Altiok (Hrsg.), Queueing Networks with Blocking. Amsterdam: North-Holland, Elsevier Science Publishers. S. 127–144.

Gershwin, S. B. (1991). Assembly/disassembly systems: An efficient decom-position algorithm for tree-structured networks. IIE Transactions 23 (4),302–314.

Gershwin, S. B. (1994). Manufacturing Systems Engineering. EnglewoodCliffs: Prentice-Hall.

Gershwin, S. B., und O. Berman (1981). Analysis of transfer lines consistingof two unreliable machines with random processing times and finite storagebuffers. AIIE Transactions 13 (1), 2–11.

Gershwin, S. B., und M. H. Burman (2000). A decomposition method foranalyzing inhomogeneous assembly/disassembly systems. Annals of Opera-tions Research 93, 91–115.

Gershwin, S. B., und I. C. Schick (1980, September). Continuous model ofan unreliable two-stage material flow system with a finite interstage buffer.Forschungsbericht LIDS-R-1039, Laboratory for Information and DecisionSystems, Massachusetts Institute of Technology.

Gershwin, S. B., und I. C. Schick (1983). Modeling and analysis of three-stage transfer lines with unreliable machines and finite buffers. OperationsResearch 31 (2), 354–380.

Gershwin, S. B., und J. E. Schor (2000). Efficient algorithms for bufferspace allocation. Annals of Operations Research 93, 117–144.

Gershwin, S. B. (1993). Variance of output of a of tandem production system.In: R. D. Onvural und I. F. Akyildiz (Hrsg.), Queueing Networks withFinite Capacity. Amsterdam: North-Holland, Elsevier Science Publishers.S. 291–304.


Gun, L., und A. M. Makowski (1989). An approximation method for gene-ral tandem queueing systems subject to blocking. In: H. G. Perros undT. Altiok (Hrsg.), Queueing Networks with Blocking. Amsterdam: North-Holland, Elsevier Science Publishers. S. 147–171.

Gunther, H.-O., und H. Tempelmeier (1995). Produktionsmanagement —Einfuhrung mit Ubungsaufgaben (2. Aufl.). Berlin: Springer.

Gunther, H.-O., und H. Tempelmeier (2003). Produktion und Logistik (5.Aufl.). Berlin, Heidelberg, New York: Springer.

Gordon, W. J., und G. F. Newell (1967). Cyclic queueing systems withrestricted queues. Operations Research 15 (2), 266–278.

Griffel, N. (1999). Prozeßkette Ablaufsimulation — Voraussetzung zur syste-matischen Planung komplexer Produktionssysteme mit hohem Nutzungsgrad.Munchen: Hieronymus Buchreproduktions GmbH.

Gross, D., und C. M. Harris (1998). Fundamentals of Queueing Theory (3.Aufl.). Probability and Statistics. New York: Wiley.

Hahn, R. (1972). Produktionsplanung bei Linienfertigung. Berlin, New York:Walter de Gruyter.

Harrison, J. M. (1973). Assembly-like queues. Journal of Applied Probabili-ty 10, 354–367.

Helber, S. (1995, Dezember). Exact analysis of the two-machine transfer linewith limited buffer capacity and geometrically distributed processing times,times to failure and times to repair. Forschungsbericht, Ludwig-Maximilians-Universitat Munchen, Fakultat fur Betriebswirtschaftslehre, Institut furProduktionswirtschaft und Controlling.

Helber, S. (1996, Februar). Decomposition of unreliable assemb-ly/disassembly networks with limited buffer capacity and random proces-sing times. part ii: Continuous time model. Forschungsbericht, Ludwig-Maximilians-Universitat Munchen, Fakultat fur Betriebswirtschaftslehre,Institut fur Produktionswirtschaft und Controlling.


Helber, S. (1998). Decomposition of unreliable assembly/disassembly net-works with limited buffer capacity and random processing times. EuropeanJournal of Operational Research 109, 24–42.

Helber, S. (1999). Performance Analysis of Flow Lines with Non-Linear Flowof Material, Band 473 von Lecture Notes in Economics and MathematicalSystems. Berlin, Heidelberg, New York: Springer.

Helber, S. (2000). Kapitalwertorientierte Pufferallokation in stochasti-schen Fließproduktionssystemen. Zeitschrift fur betriebswirtschaftliche For-schung 52, 211–233.

Hendricks, K. B. (1992). The output processes of serial production lines ofexponential machines with finite buffers. Operations Research 40 (6), 1139–1147.

Hillier, F. S., und R. W. Boling (1966). The effect of some design factors onthe efficiency of production lines with variable operation times. The Journalof Industrial Engineering 17, 651–658.

Hillier, F. S., und R. W. Boling (1967). Finite queues in series with expo-nential or Erlang service times — a numerical approach. Operations Rese-arch 15 (2), 286–303.

Hillier, F. S., und G. J. Lieberman (1995). Introduction to OperationsResearch (6. Aufl.). New York: McGraw-Hill.

Hillier, F. S., und K. C. So (1993). Some data for applying the bowl pheno-menon to large production line systems. International Journal of ProductionResearch 31 (4), 811–822.

Hillier, F. S., und K. C. So (1995). On the optimal design of tandem queu-eing systems with finite buffers. Queueing Systems 21, 245–266.

Hopp, W. J., und J. T. Simon (1989). Bounds and heuristics for assembly-likequeues. Queueing Systems 4, 137–156.


Hopp, W. J., und M. L. Spearman (2000). Factory Physics — Foundationsof Manufacturing Management (2. Aufl.). Singapur: Irwin/McGraw-Hill.

Hupen, R. (1994). Arbeitszeit, Betriebszeit und Beschaftigung — Produktions-theoretische Grundlagen und Beschaftigungseffekte kollektiver Arbeitszeit-verkurzung. Wiesbaden: DUV Deutscher Universitatsverlag. (zugl. Habil.Ruhr-Universitat Bochum, 1993).

Hunt, G. C. (1956). Sequential arrays of waiting lines. Operations Rese-arch 4 (6).

Inman, R. R., und R. L. Bulfin (1991). Sequencing JIT mixed-model assem-bly lines. Management Science 37 (7), 901–904.

Jafari, M. A., und J. G. Shanthikumar (1989). Determination of opti-mal buffer storage capacities and optimal allocation in multistage automatictransfer lines. IIE Transactions 21 (2), 130–135.

Jeong, K.-C., und Y.-D. Kim (1998). Performance analysis of assemb-ly/disassembly systems with unreliable machines and random processingtimes. IIE Transactions 30 (1), 41–53.

Jeong, K.-C., und Y.-D. Kim (2000). Heuristics for selecting machines anddetermining buffer capacities in assembly systems. Computers & IndustrialEngineering 38, 341–360.

Kistner, K.-P. (1974). Betriebsstorungen und Warteschlangen — Die Erfas-sung storungsbedingter Stauungen mit der Warteschlangenthoerie, Band 38von Beitrage zur betriebswirtschaftlichen Forschung. Opladen: Westdeut-scher Verlag.

Kleinrock, L. (1975). Queueing Systems, Band I: Theory. New York, Chi-chester, Brisbane, Toronto: Wiley.

Knott, K., und R. J. Sury (1987). A study of work-time distributions onunpaced tasks. IIE Transactions 19 (3), 302–314.


Krieg, G. N., und H. Kuhn (2002, August). Analysis of Asynchro-nous Flow Lines: The Starving Probability of a Subsystem Excludes Si-multaneous Blocking and Starving. Arbeitsbericht, Katholische Univer-sitat Eichstatt/Ingolstadt, Lehrstuhl fur Allgemeine Betriebswirtschaftsleh-re, Produktionswirtschaft und Industriebetriebslehre, Ingolstadt.

Krieg, G. N., und M. Manitz (2002, September). Ein zeitraumbezo-gener Ansatz zur Herleitung des FLRMEXP-Verfahrens nach Buzacottund Shanthikumar. Arbeitsbericht, Katholische Universitat Eichstatt/In-golstadt, Lehrstuhl fur Allgemeine Betriebswirtschaftslehre, Produktions-wirtschaft und Industriebetriebslehre, Universitat zu Koln, Seminar furAllgemeine Betriebswirtschaftslehre und Produktionswirtschaft, Ingolstadt,Koln.

Kubiak, W. (1993). Minimizing variation of production rates in just-in-timesystems: A survey. European Journal of Operational Research 66, 259–271.

Kubiak, W., und S. Sethi (1991). A note on ”Level schedules for mixed-model assembly lines in just-in-time production systems“. ManagementScience 37 (1), 121 f.

Kuhn, H. (1998). Fließproduktionssysteme — Leistungsbewertung,Konfigurations- und Instandhaltungsplanung, Band 67 von Physica-Schriftenzur Betriebwirtschaft. Heidelberg: Physica.

Kuhn, H., und H. Tempelmeier (1997). Analyse von Fließproduktionssyste-men. Zeitschrift fur Betriebswirtschaft 67 (5).

Labetoulle, J., und G. Pujolle (1980). Isolation method in a network ofqueues. IEEE Transactions on Software Engineering SE-6 (4), 373–381.

Latouche, G. (1981). Queues with paired customers. Journal of AppliedProbability 18, 684–696.

Lau, H.-S., und G. E. Martin (1987). The effects of skewness and kurtosisof processing times in unpaced lines. International Journal of ProductionResearch 25 (10), 1483–1492.


Levantesi, R., A. Matta und T. Tolio (2001, Mai). A new algorithm forbuffer allocation in production lines. In: Third Aegean International Con-ference on ”Design and Analysis of Manufacturing Systems“. S. 279–288.University of the Aegean, Panhellenic Religious Foundation ”Evangelistriaof Tinos“, Municipality of Tinos.

Lipper, E. H., und E. H. Sengupta (1986). Assembly-like queues with finitecapacity: Bounds, asymptotics and approximations. Queueing Systems 1,67–83.

Little, J. D. C. (1961). A proof for the queueing formula: L = λW . Opera-tions Research 9 (3), 383–387.

Liu, X.-G. (1990). Towards Modeling Assembly Systems — Application ofQueueing Networks with Blocking. Ph. D. thesis, University of Waterloo.

MacGregor Smith, J., und F. R. B. Cruz (2000, September).The buffer allocation problem for general finite buffer queueing net-works. citeseer.ist.psu.edu/smith00buffer.html (abgerufen am4. Marz 2004).

Marchal, W. G. (1976). An approximate formula for waiting time in singleserver queues. AIIE Transactions 8 (4), 473 f.

Miltenburg, G. J. (1987). Variance of the number of units produced ona transfer line with buffer inventories during a period of length t. NavalResearch Logistics 34, 811–822.

Miltenburg, G. J. (1989). Level schedules for mixed-model assembly linesin just-in-time production systems. Management Science 35 (2), 192–207.

Muller, P. H., (Hrsg.) (1991). Wahrscheinlichkeitsrechnung und mathemati-sche Statistik: Lexikon der Stochastik (5. Aufl.). Berlin: Akademie-Verlag.

Mood, A. M., F. A. Graybill und D. C. Boes (1974). Introduction tothe Theory of Statistics (3. Aufl.). Probability and Statistics. Auckland,Singapore: McGraw-Hill.


Morse, P. M. (1958). Queues, Inventories and Maintenance — The Analysisof Operational Systems with Variable Demand and Supply. Nummer 1 inPublications in Operations Research. New York, London, Sydney: JohnWiley & Sons.

Mosler, K., und F. Schmid (2004). Wahrscheinlichkeitsrechnung und schlie-ßende Statistik. Berlin, Heidelberg: Springer.

Muth, E. J. (1973). The production rate of a series of work stations withvariable service times. International Journal of Production Research 11 (2),155–169.

Muth, E. J. (1979). The reversibility property of production lines. Manage-ment Science 25 (2), 152–158.

Nelson, R. (1995). Probability, Stochastic Processes, and Queueing — TheMathematics of Computer Performance Modeling. New York: Springer.

Neumann, K., und M. Morlock (1993). Operations Research. Munchen,Wien: Hanser.

Onvural, R. O. (1989). Survey of closed queueing networks with blocking.ACM Computing Surveys 22 (2), 83–121.

Onvural, R. O. (1990). Closed queueing networks with blocking. In: H. Ta-kagi (Hrsg.), Stochastic Analysis of Computer and Communication Sy-stems. North-Holland: Elsevier Science Publishers. S. 499–528.

Onvural, R. O., und H. G. Perros (1986). On equivalencies of blockingmechanisms in queueing networks with blocking. Operations Research Let-ters 5 (6), 293–298.

Papadopoulos, H. T., C. Heavey und J. Browne (1993). Queueing Theoryin Manufacturing Systems Analysis and Design. London: Chapman & Hall.

Parello, B. D., W. C. Kabat und L. Wos (1986). Job-shop scheduling usingautomated reasoning: A case study of the car-sequencing problem. Journalof Automated Reasoning 2, 1–42.


Park, T. (1993). A two-phase heuristic algorithm for determining buffer sizesof production lines. International Journal of Production Research 31 (3),613–631.

Perros, H. G., und T. Altıok (1986). Approximate analysis of open networksof queues with blocking: Tandem configurations. IEEE Transactions onSoftware Engineering SE-12 (3), 450–461.

Pittel, B. (1979). Closed exponential networks of queues with saturation:The jackson-type stationary distribution and its asymptotic analysis. Ma-thematics of Operations Research 4 (4), 357–378.

Powell, S. G., und D. F. Pyke (1994). An empirical investigation of thetwo-moment approximation for production lines. International Journal ofProduction Research 32 (5), 1137–1157.

Rao, P. C., und R. Suri (1994). Approximate queueing network models forclosed fabrication/assembly systems — Part I: Single level systems. Produc-tion and Operations Management 3 (4), 244–275.

Rao, P. C., und R. Suri (2000). Performance analysis of an assembly stati-on with input from multiple fabrication lines. Production and OperationsManagement 9 (3), 283–302.

Rosenberg, O. (1996). Variantenfertigung (2. Aufl.), Band VII von En-zyklopadie der Betriebswirtschaftslehre, S. 2119–2129. Stuttgart: Schaffer-Poeschel.

Schlittgen, R. (1996). Statistische Inferenz. Munchen: Oldenbourg.

Scholl, A. (1999). Balancing and Sequencing of Assembly Lines (2. Aufl.).Contributions to Management Science. Heidelberg: Physica.

Schor, J. E. (1995, Mai). Efficient algorithms for buffer allocation. Ma-ster thesis, Laboratory for Manufacturing and Productivity, MassachusettsInstitute of Technology, Cambridge. Forschungsbericht LMP-95-006.


Seuffert, D. (1994). Innovative Produktionsmethoden in der Automobilindu-strie, Band 19 von Nomos Universitatsschriften Wirtschaft. Baden-Baden:Nomos.

Sewastjanow, B. A. (1962). Influence of storage bin capacity on the averagestandstill time of a production line. Theory of Probability and Its Applica-tions 7, 429–438.

Shanthikumar, J. G., und J. A. Buzacott (1980). On the approximati-ons to the single server queue. International Journal of Production Rese-arch 18 (6), 761–773.

Shanthikumar, J. G., und M. Gocmen (1983). Heuristic analysis of closedqueueing networks. International Journal of Production Research 21 (5),675–690.

Spieckermann, S. (2002). Neue Losungsansatze fur ausgewahlte Planungs-probleme in Automobilrohbau und -lackiererei. Schriften zur quantitativenBetriebwirtschaftslehre und Wirtschaftsinformatik. Aachen: Shaker.

Spieckermann, S., K. Gutenschwager, H. Heinzel und S. Voß (2000).Simulation-based Optimization in the Automotive Industry — A Case Studyon Body Shop Design. Arbeitsbericht, SimPlan Gesellschaft fur Simulationbetrieblicher Ablaufe mbH und Technische Universitat Braunschweig, Insti-tut fur Wirtschaftswissenschaften, Maintal und Braunschweig.

Spinellis, D., C. Papadopoulos und J. MacGregor Smith (2000). Largeproduction line optimization using simulated annealing. International Jour-nal of Production Research 38 (3), 509–541.

Steiner, G., und S. Yeomans (1993). Level schedules for mixed-model as-sembly lines, just-in-time processes. Management Science 39 (6), 728–735.

Suri, R., J. L. Sanders und M. Kamath (1993). Performance evaluation ofproduction networks. In: G. L. Nemhauser und A. H. G. Rinnooy Kan

(Hrsg.), Logistics of Production and Inventory, Band 4 von Handbooks inOperations Research and Management Science. Elsevier Science Publishers.S. 199–286.


Tempelmeier, H. (1996). Flexible Fertigungstechniken. In: W. Kern, H.-H.Schroder und J. Weber (Hrsg.), Handworterbuch der Produktionswirt-schaft (2. Aufl.). Stuttgart: Schaffer-Poeschel. Sp. 502–512.

Tempelmeier, H. (2003a). Practical considerations in the optimization of flowproduction systems. International Journal of Production Research 41 (1),149–170.

Tempelmeier, H. (2003b). Simultaneous buffer and workload optimizationfor asynchronous flow production systems. In: Proceedings of the ForthAegean International Conference on Analysis of Manufacturing Systems, 1.bis 4. Juli 2003, Samos. University of the Aegean.

Tempelmeier, H., und M. Burger (2001). Performance evaluation of un-balanced flow lines with general distributed processing times, failures andimperfect production. IIE Transactions 33, 293–302.

Tempelmeier, H., und H. Kuhn (1993). Flexible Fertigungssysteme — Ent-scheidungsunterstutzung fur Konfiguration und Betrieb. Berlin, Heidelberg:Springer.

Walrand, J. (1988). An Introduction to Queueing Networks. EnglewoodCliffs: Prentice-Hall.

Whitt, W. (1983). The queueing network analyzer. The Bell System TechnicalJournal 62 (9), 2779–2815.

Wijngaard, J. (1979). The effect of interstage buffer storage on the outputof two unreliable production units in series, with different production rates.AIIE Transactions 11 (1), 42–47.

Wolff, R. W. (1982). Poisson arrivals see time averages. Operations Rese-arch 30 (2), 223–231.

Yamashita, H., und T. M. Altıok (1998). Buffer capacity allocation for adesired trouhgput in production lines. IIE Transactions 30, 883–891.


Yamazaki, G., T. Kawashima und H. Sakasegawa (1985). Reversibility oftandem blocking queueing systems. Management Science 31 (1), 78–83.

Yamazaki, G., und H. Sakasegawa (1975). Properties of duality in tandemqueueing systems. Annals of the Institute of Statistical Mathematics 27,201–212.

Zimmern, B. (1956). Etudes de la propagation des arrets aletoires dans leschaines de production. Revue de Statistique Appliquee 4, 85–104.

Zapfel, G. (1989). Taktisches Produktions-Management. Berlin, New York:de Gruyter.

Documents

Literaturverzeichnis - link.springer.com978-3-658-24246-6/1.pdf · blocking before service. Performance Evaluation 10, – Gaver, D. P. (1962). A waiting line with interrupted service,