Skip to main content
SpringerLink
Log in

Planung logistischer Systeme

  • Chapter
Handbuch Logistik

Part of the book series: VDI-Buch ((VDI-BUCH))

  • 60k Accesses

Abstract

Die Ansätze zur Standortplanung lassen sich in drei Gruppen einteilen, nämlich in solche, in denen überwiegend volkswirtschaftliche, betriebliche oder innerbetriebliche Standortplanungsprobleme betrachtet werden. Für die innerbetriebliche Standortplanung wird auch der Begriff „Layoutplanung“ verwendet.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 309.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 399.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Agar, M.C.; Salhi, S.: Lagrangean heuristics applied to a variety of large capacitated plant location problems. J. of the Opl. Res. Soc. 49 (1998) 1072–1084

    Article  MATH  Google Scholar 

  2. Barcelo, J.; Hallefjord, A. et al.: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR Spektr. 12 (1990) 79–88

    Article  MathSciNet  MATH  Google Scholar 

  3. Baumol, W.J.; Wolfe, P.: A warehouse-location problem. Oprns. Res. 6 (1958) 181–211

    MathSciNet  Google Scholar 

  4. Beasley, J.E.: Lagrangean heuristics for location problems. Europ. J. of OR 65 (1993) 383–399

    Article  MATH  Google Scholar 

  5. Benati, S.; Laporte, G.: Tabu search algorithms for the (r|Xp)medianoid and (r|p)centroid problems. Location Sci. 2 (1994) 193–204

    MATH  Google Scholar 

  6. Berens, W.; Körling, F.-J.: Das Schätzen von realen Entfernungen bei der Warenverteilungsplanung mit gebietspaarspezifischen Umwegfaktoren. OR Spektr. 5 (1983) 67–75

    Article  Google Scholar 

  7. Berman, O.; Einav, D. et al.: The zoneconstrained location problem on a network. Europ. J. of OR 53 (1991) 14–24

    Article  MATH  Google Scholar 

  8. Berman, O.; Larson, R.C. et al.: Optimal location of discretionary service facilities. Transportation Sci. 26 (1992) 201–211

    MATH  Google Scholar 

  9. Berman, O.; Jaillet, P. et al.: Locationrouting problems with uncertainty. In: Drezner, Z. (ed.): Facility location: A survey of applications and methods. New York: Springer 1995, 427–452

    Google Scholar 

  10. Brimberg, J.; Dowling, P.D. et al.: The weighted one-two norm distance model: Empirical validation and confidence interval estimation. Location Sci. 2 (1994) 91–100

    MATH  Google Scholar 

  11. Brimberg, J.; Mehrez, A.: Multi-facility location using a maximin criterion and rectangular distances. Location Sci. 2 (1994) 11–19

    MATH  Google Scholar 

  12. Campbell, J.F.: A survey of network hub location. Studies in Locational Analysis 6 (1994) 31–47

    Google Scholar 

  13. Christofides, N.; Beasley, J.E.: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem. Europ. J. of OR 12 (1983) 19-28

    Article  MathSciNet  MATH  Google Scholar 

  14. Cooper, L.: The transportation-location problem. Oprns. Res. 20 (1972) 94–108

    MATH  Google Scholar 

  15. Crainic, T.G.; Delorme, L. et al.: A branch-and-bound method for multicommodity location with balancing requirements. Europ. J. of OR 65 (1993) 368-382

    Article  MATH  Google Scholar 

  16. Dearing, P.M.; Newruck, F.C.: A capacitated bottleneck facility location problem. Management Sci. 25 (1979) 1093–1104

    Article  MathSciNet  MATH  Google Scholar 

  17. Domschke, W.; Drexl, A.: Logistik: Standorte. 4. Aufl. München: Oldenbourg 1996

    Google Scholar 

  18. Domschke, W.; Krispin, G.: Location and layout planning – A survey. OR Spektr. 19 (1997) 181–194

    MathSciNet  MATH  Google Scholar 

  19. Drezner, Z. (ed.): Facility location – A survey of applications and methods. New York: Springer 1995

    Google Scholar 

  20. Eiselt H.A.; Laporte, G. et al.: Competitive location models: A framework and bibliography. Transportation Sci. 27 (1993) 44–54

    Article  MathSciNet  MATH  Google Scholar 

  21. Erkut, E.; Neuman, S.: Analytical models for locating undesirable facilities. Europ. J. of OR 40 (1989) 275–291

    Article  MathSciNet  MATH  Google Scholar 

  22. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oprns. Res. 26 (1978) 992–1009

    Article  MathSciNet  MATH  Google Scholar 

  23. Fischer, K.: Standortplanung unter Berücksichtigung verschiedener Marktbedingungen. Heidelberg: Physica 1997

    Google Scholar 

  24. Fleischmann, B.: Designing distribution systems with transport economies of scale. Europ. J. of OR 70 (1993) 31–42

    Article  MATH  Google Scholar 

  25. Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oprns. Res. 12 (1964) 450–459

    MATH  Google Scholar 

  26. Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oprns. Res. 13 (1965) 462-475

    MathSciNet  MATH  Google Scholar 

  27. Hakimi, S.L.: On locating new facilities in a competitive environment. Europ. J. of Opl. Res. 12 (1983) 29–35

    Article  MathSciNet  MATH  Google Scholar 

  28. Hamacher, H.W.; Nickel, S.: Combinatorial algorithms for some 1facility median problems in the plane. Europ. J. of OR 79 (1994) 340–351

    Article  MATH  Google Scholar 

  29. Hansen, P.H.; Hegedahl, B. et al.: A heuristic solution to the warehouse location routing problem. Europ. J. of Opl. Res. 76 (1994) 111–127

    Article  MATH  Google Scholar 

  30. Harche, F.; Thompson, G.L.: The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems. Comput. & Oprns. Res. 21 (1994) 689–705

    Article  MATH  Google Scholar 

  31. Hotelling, H.: Stability in competition. Economic J. 39 (1929) 41–57

    Article  Google Scholar 

  32. Hummeltenberg, W.: Optimierungsmethoden zur betrieblichen Standortwahl. Würzburg: Physica 1981

    Google Scholar 

  33. Jaeger, M.; Goldberg, J.: A polynomial algorithm for the equal capacity pcenter problem on trees. Transportation Sci. 28 (1994) 167–175

    MathSciNet  MATH  Google Scholar 

  34. Klincewicz, J.G.; Luss, H.: A dual-based algorithm for multiproduct uncapacitated facility location. Transportation Sci. 21 (1987) 198–206

    MATH  Google Scholar 

  35. Klincewicz, J.G.: A dual algorithm for the uncapacitated hub location problem. Location Sci. 4 (1996) 173–184

    Article  MATH  Google Scholar 

  36. Klose, A.: Das kombinatorische PMedian-Modell und Erweiterungen zur Bestimmung optimaler Standorte. Diss. Universität St. Gallen, (Schweiz) 1993

    Google Scholar 

  37. Klose, A.: Obtaining sharp lower and upper bounds for two-stage capacitated facility location problems. In: Fleischmann, B. et al. (eds.): Advances in distribution logistics. Berlin: Springer 1998, 185–213

    Google Scholar 

  38.  Klose, A.; Drexl, A.: Facility location models for distribution system design. Europ. J. of OR 162 (2005), 4-29

    Article  MathSciNet  MATH  Google Scholar 

  39. Körkel, M.: On the exact solution of large-scale simple plant location problems. Europ. J. of OR 39 (1989) 157–173

    Article  MATH  Google Scholar 

  40. Krispin, G.; Wagner, B.: HubLocater: An exact solution method for the multiple allocation hub location problem. Schriften zur Quantitativen Betriebswirtschaftslehre 12/98. Institut für Betriebswirtschaftslehre, TU Darmstadt 1998

    Google Scholar 

  41. Kuehn, A.A.; Hamburger, M.J.: A heuristic program for locating warehouses. Management Sci. 9 (1963) 643–666

    Google Scholar 

  42. Labbé, M.; Louveaux, F.V.: Location problems. In: Dell‘ Amico, M. et al. (eds.): Annotated bibliographies in combinatorial optimization. Chichester: Wiley & Sons 1997, 261–281

    Google Scholar 

  43. Launhardt, W.: Der zweckmäßigste Standort einer gewerblichen Anlage. Z. VDI 26 (1882) 105–116

    Google Scholar 

  44. Louveaux, F.V.; Peeters, D.: A dualbased procedure for stochastic facility location. Oprns. Res. 40 (1992) 564–573

    MathSciNet  MATH  Google Scholar 

  45. Love, R.F.; Morris, J.G.: Modelling intercity road distance by mathematical functions. OR Quarterly 23 (1972) 61–71

    MATH  Google Scholar 

  46. Love, R.F.; Walker, J.H.: An empirical comparison of block and round norms for modelling actual distances. Location Sci. 2 (1994) 21–43

    MATH  Google Scholar 

  47. Mayer, G.: Strategische Logistikplanung von Hub & Spoke-Systemen. Wiesbaden: Dt. Univ. Verl. 2001

    Google Scholar 

  48. Miller T.C.; Friesz, T.L. et al.: Equilibrium facility location on networks. Berlin: Springer 1995

    Google Scholar 

  49. Minieka, E.: The m-center problem. SIAM Rev. 12 (1970) 138–139

    Article  MathSciNet  MATH  Google Scholar 

  50. O‘Kelly, M.E.: Hub facility location with fixed costs. Papers in Regional Sci.: The J. of the RSAI 71 (1992) 293–306

    Article  Google Scholar 

  51. Poppenborg, C.: Standortplanung für Locally Unwanted Land Uses. Wiesbaden: Dt. Univ.-Verl. 1996

    Google Scholar 

  52. ReVelle, C.: The maximum capture or „sphere of infiuence“ location problem: Hotelling revisited on a network. J. of Regional Sci. 26 (1986) 343–358

    Article  Google Scholar 

  53. Schildt, B.: Strategische Produktions- und Distributionsplanung – Betriebliche Standortoptimierung bei degressiv verlaufenden Produktionskosten. Wiesbaden: Dt. Univ.-Verl. 1994

    Google Scholar 

  54. Schütz, G.: Verteilt-parallele Ansätze zur Distributionsplanung. Wiesbaden: Dt. Univ.-Verl. 1997

    Google Scholar 

  55. Shulman, A.: An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes. Oprns. Res. 39 (1991) 423–436

    MATH  Google Scholar 

  56.  Wagner, B.: Hub & Spoke-Netzwerke in der Logistik - Modellbasierte Lösungsansätze für ihr Design. Wiesbaden: Deutscher Universitäts-Verlag 2006

    Google Scholar 

  57. Weber, A.: Über den Standort der Industrien. 1. Teil: Reine Theorie des Standortes. Tübingen 1909

    Google Scholar 

  58. Wentges, P.: Standortprobleme mit Berücksichtigung von Kapazitätsrestriktionen: Modellierung und Lösungsverfahren. Bamberg: Difo-Druck 1994

    Google Scholar 

  59. Askin, R.G.; Standridge, C.R.: Modeling and analysis of manufacturing systems. New York: Wiley & Sons 1993

    MATH  Google Scholar 

  60. Bitran, G.R.; Tirupati, D.: Tradeoff curves, targeting and balancing in manufacturing queueing networks. Operations Res. 37 (1989) 4, 547–564

    MathSciNet  MATH  Google Scholar 

  61. Buzacott, J.A.; Shanthikumar, J.G.: Stochastic models of manufacturing systems. Englewood Cliffs, N.J. (USA): Prentice Hall

    Google Scholar 

  62. Calabrese, J.M.; Hausman, W.H.: Simultaneous determination of lot sizes and routing mix in job shops. Management Sci. 37 (1991) 1043–1057

    MATH  Google Scholar 

  63. Günther, H.-O.; Tempelmeier, H.: Produktionsmanagement – Einführung mit Übungsaufgaben. Berlin: Springer 1995

    Google Scholar 

  64. Networks of waiting lines. Operations Research 5 (1957), 518–521

    Google Scholar 

  65. Karmarkar, U.; Kekre, S.: Manufacturing configuration, capacity and mix decisions considering operational costs. J. of Manufacturing Systems 6 (1987) 4, 315–324

    Article  Google Scholar 

  66. Karmarkar, U.: Manufacturing lead times, order release and capacity loading. In: Graves, S.C.; Rinnooy Kan, A.H.G.; Zipkin, P.H. (eds.): Logistics of production and inventory. Amsterdam: North Holland 1993

    Google Scholar 

  67. Rao, S.S.; Gunasekaran, A. et al.: Waiting line model applications in manufacturing. Int. J. of Production Res. 54 (1998) 1–28

    Article  Google Scholar 

  68. Suri, R.; Diehl. G.W.W. et al.: From CAN-Q to MPSX: Evolution of queuing software for manufacturing. Interfaces 25 (1995) 5, 128–150

    Google Scholar 

  69. Tempelmeier, H.; Kuhn, H.: Flexible Fertigungssysteme – Entscheidungsunterstützung für Konfiguration und Betrieb. Berlin: Springer 1993

    Google Scholar 

  70. Tempelmeier, H.: Material-Logistik – Modelle und Algorithmen für die Produktionsplanung und -steuerung in Advanced Planning-Systemen. Berlin: Springer 2006

    Google Scholar 

  71. Visvanadham, N.; Narahari, Y.: Performance modeling of automated manufacturing systems. Englewood Cliffs, N.J. (USA): Prentice Hall 1992

    Google Scholar 

  72. Bleymüller, J.; Gehlert, G.; Gülicher H.: Statistik für Wirtschaftswissenschaftler. 13. Aufl. München: Vahlen 2002

    Google Scholar 

  73. Blumenfeld, D.: A simple formula for estimating throughput of serial production lines with variable processing times and limited buffer capacity. Int. J. Prod. Res. 28 (1990) 1163–1182

    Article  Google Scholar 

  74. Bürger, M.: Konfigurationsplanung flexibler Fließproduktionssysteme. Glienicke: Galda + Wilch 1997

    Google Scholar 

  75. Burman, M.H.: New results in flow line analysis. Ph.D. Thesis, Mass. Inst. of Technol. (MIT). Also available as Report LMP-95-007, MIT Laboratory for Manufacturing and Productivity. Cambridge, MA. (USA) 1995

    Google Scholar 

  76. Buzacott, J.A.; Shanthikumar, J.G.: Stochastic models of manufacturing systems. Englewood Cliffs, N.J. (USA): Prentice Hall 1993

    MATH  Google Scholar 

  77. Buzacott, J.; Liu, X.-G.; Shanthikumar, J.: Multistage flow line analysis with the stopped arrival queue model. IIE Trans. 27 (1995) 4, 444–455

    Article  Google Scholar 

  78. Dallery, Y.; David, R.; Xie, X.-L.: An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers. IIE Trans. 20 (19-88) 3, 280-283

    Article  Google Scholar 

  79. Dallery, Y.; Gershwin, S.B.: Manufacturing flow line systems: A review of models and analytical results. Queuing Systems Theory and Applications 12 (1992) 1 + 2, 3–94

    Article  MATH  Google Scholar 

  80. Domschke, W.; Scholl, A; Voß, S.: Produktionsplanung. 2. Aufl. Berlin: Springer 1997

    Google Scholar 

  81. Fink, A.; Voß, S.: Maynard assembly manager. OR Spektrum 20 (1998) 3, 143–145

    Article  Google Scholar 

  82. Gaver, D.: A waiting line with interrupted service, including priorities. J. Roy. Stat. Soc. 24 (1962) 73–90

    MathSciNet  MATH  Google Scholar 

  83. Gershwin, S.B.: Manufacturing systems engineering. Englewood Cliffs, N.J. (USA): Prentice Hall 1994

    Google Scholar 

  84. Gershwin, S.B.; Schor, J.E.: Efficient algorithms for buffer space allocation. Annals of Operations Res., 93 (2000) 117–144

    Article  MathSciNet  MATH  Google Scholar 

  85. Helber, S.: Performance analysis of flow lines with non-linear flow of material. Vol. 473 of Lecture Notes in Economics and Mathematical Systems. Berlin: Springer 1999

    MATH  Google Scholar 

  86. Helber, S.: Kapitalorientierte Pufferallokation in stochastischen Fließproduktionssystemen. Z.f. betriebswirtschaftl. Forsch. 52 (2000) 211–233

    Google Scholar 

  87. Kuhn, H.; Tempelmeier, H.: Analyse von Fließproduktionssystemen. Z. f. Betriebswirtsch. 67(1997) 561–586

    Google Scholar 

  88. Kuhn, H.: Fließproduktionssysteme: Konfigurations- und Instandhaltungsplanung. Heidelberg: Physica 1998

    Google Scholar 

  89. Küpper, H.-U.; Helber, S.: Ablauforganisation in Produktion und Logistik. 3. Aufl. Stuttgart: Schäffer-Poeschel 2004

    Google Scholar 

  90. Papadopoulus, H.; Heavey, C.; Browne, J.: Queueing theory in manufacturing systems analysis and design. London: Chapman & Hall 1993

    Google Scholar 

  91. Scholl, A.: Balancing and sequencing of assembly lines. Heidelberg: Physica 1995

    Google Scholar 

  92. Schor, J.E.: Efficient algorithms for buffer allocation. Master‘s Thesis, Mass. Inst. of Technol. (MIT). Also available as Report LMP-95-006, MIT Laboratory for Manufacturing and Productivity. Cambridge, MA. (USA) 1995

    Google Scholar 

  93. Swain, J.J.: 1999 Simulation software survey. OR/MS Today 26 (1999) 1, 42–51

    MathSciNet  Google Scholar 

  94. Tempelmeier, H.: FlowEval. Handbuch der Version 3.0. Univ. zu Köln, Seminar für Allg. Betriebswirtschaftslehre und Produktionswirtschaft, Köln 2001

    Google Scholar 

  95. Askin, R.G.; Standridge, C.R.: Modeling and analysis of manufacturing systems. New York: Wiley 1993

    MATH  Google Scholar 

  96. Ballakur, A.; Steudel, H.J.: A within-cell utilization based heuristic for designing cellular manufacturing systems. Int. J. of Prod. Res. 25 (1987) 639–665

    Article  Google Scholar 

  97. Balakrisham, J.; Cheng C.H.: Multi-period planning and uncertainty issues in cellular manufacturing: A review and future directions. Europ. J. of Operational Res. 177, (2007) 1, 281–309

    Article  Google Scholar 

  98. Burbidge J.L.: The introduction of group technology. London: Heinemann 1975

    Google Scholar 

  99. Burbidge J.L.: The first step in planning group technology. Int. J. of Prod. Econom. 43 (1996) 2 + 3, 261–266

    Article  Google Scholar 

  100. Busch, R.: Arbeitsgruppierung und Fertigungsfamilienbildung. Z. f. wirtsch. Fertig. (1978) 531–535

    Google Scholar 

  101. Chu, C.-H.: Recent advances in mathematical programming for cell formation. In: Kamrani, A.K.; Parsaei, H.R.; Donald, H.L. (eds.): Planning, design, and analysis of cellular manufacturing systems. Amsterdam (Niederlande): Elsevier 1995

    Google Scholar 

  102. Defersha, F. M.; Chen, M.: A comprehensive mathematical model for the design of cellular manufacturing systems. Int. J. of Prod. Econom. 103 (2006) 2, 767–783

    Article  Google Scholar 

  103. Eberwein, R.-D.: Organisation flexibel automatisierter Produktionssysteme. Heidelberg: Physica 1989

    Google Scholar 

  104. Günther, H.-O.; Tempelmeier, H.: Produktion und Logistik. 6. Aufl. Berlin: Springer 2005

    Google Scholar 

  105. Helber, St.; Kuhn, H.: Planung von Produktionsinseln. Wirtschaftswiss. Studium 32 (2003) 2, 76–82

    Google Scholar 

  106. Heragu, S.: Facilities design. Boston: PWS Publ. Comp. 1997

    Google Scholar 

  107. Jeon, G.; Leep, H.R.: Forming part families by using genetic algorithm and designing machine cells under demand changes. Computers & Operations Res. 33 (2006) 1, 263–283

    Article  MATH  Google Scholar 

  108. Kaufmann, H.; Pape, H.: Clusteranalyse. In: Fahrmeir, L.; Brachinger, W.; Tutz, G. (Hrsg.): Multivariate statistische Verfahren. 2. Aufl. Berlin: de Gruyter 1996, 437–536

    Google Scholar 

  109. Kuhn, H.: Fertigungs- und Montagehilfsmittel: Bewirtschaftung. In: Kern, W.; Schröder, H.-H.; Weber J. (Hrsg.): Handwörterbuch der Produktion. 2. Aufl. Stuttgart: Schäffer-Poeschel 1996, Sp. 451–461

    Google Scholar 

  110. Kuhn, H.; Tempelmeier, H.: Analyse von Fließproduktionssystemen. Z. f. Betriebswirtsch. 67 (1997) 5 + 6, 561–586

    Google Scholar 

  111. Kuhn, H.: Fließproduktionssysteme: Leistungsbewertung, Konfigurations- und Instandhaltungsplanung. Heidelberg: Physica 1998

    Google Scholar 

  112. Kuhn, H.; Helber, St.: Produktionssegmentierung unter Beachtung stochastisch-dynamischer Einflussgrößen. Wirtschaftswiss. Studium 33 (2004) 8, 463–469

    Google Scholar 

  113. Kuhn, H.: Simulation. In: Köhler, R.; Küpper, H.-U.; Pfingsten, A. (Hrsg.): Handwörterbuch der Betriebswirtschaft. 6. Aufl. Stuttgart: Schäffer-Poeschel 2007, 1624–1632

    Google Scholar 

  114. Mahdavi, I.; Babak Javadi, B.; Fallah-Alipour, K.; Slomp, J.: Designing a new mathematical model for cellular manufacturing system based on cell utilization. Applied Mathematics and Computation. erscheint 2007

    Google Scholar 

  115. Maßberg, W. (Hrsg.): Fertigungsinseln in CIM-Strukturen. Berlin: Springer 1993

    Google Scholar 

  116. Maßberg, W.; Sossna, F: Reorganisierung gruppentechnologischer Fertigungsstrukturen. Z. f. wirtsch. Fertig. 94 (1999) 409–413

    Google Scholar 

  117. Mitrofanow, S.P.: Wissenschaftliche Grundlagen der Gruppentechnologie. Berlin: VEB Verlag Technik 1960

    Google Scholar 

  118. Mohamed, Z.M.; Bernardo, J.J.: Tool planning models for flexible manufacturing systems. Europ. J. of Operational Res. 103 (1997) 497–514

    Article  MATH  Google Scholar 

  119. Opitz, H.: Verschlüsselungsrichtlinien und Definitionen zum werkstückbeschreibenden Klassifizierungssystem. Essen: Girardet 1971

    Google Scholar 

  120. Papadopoulos, H.T.; Heavey, C.; Browne, J.: Queueing theory in manufacturing systems analysis and design. London: Chapman & Hall 1993

    Google Scholar 

  121. Picot, A.; Dietl, H.; Franck, E.: Organisation: Eine ökonomische Perspektive. Stuttgart: Schäffer-Poeschel 1997

    Google Scholar 

  122. Reisman, A.; Kumar, A. et al.: Cellular manufacturing: A statistical review of the literature (1965–1995). Operations Res. 45 (1997) 4, 508–520

    MATH  Google Scholar 

  123. Safaei, N.; Saidi-Mehrabad, M.; Jabal-Ameli, M.S.: A hybrid simulated annealing for solving an extended model of dynamic cellular manufacturing system. Europ. J. of Operational Res. erscheint 2007

    Google Scholar 

  124. Sarker, B.R.; Mondal, S.: Grouping efficiency measures in cellular manufacturing: A survey and critical review. Int. J. of Prod. Res. 37 (1999) 2, 285–314

    Article  MATH  Google Scholar 

  125. Selim, H.M.; Askin, R.G.; Vakharia, A.J.: Cell formation in group technology: Review, evaluation and directions for future research. Computers Industrial Engg. 34 (1998) 1, 3–20

    Article  Google Scholar 

  126. Shafer, S.M.; Rogers, D.F.: Similarity and distance measures for cellular manufacturing. Int. J. of Prod. Res. 31 (1993) 1133–1142 u. 1315–1326

    Article  Google Scholar 

  127. Singh, N.; Rajamani, D.: Cellular manufacturing systems: Design, planning and control. London: Chapman & Hall 1996

    Google Scholar 

  128. Slomp, J.: The design and operation of flexible manufacturing shops. In: Artiba, A.; Elmaghraby, S.E. (eds.): The planning and scheduling of production systems. London: Chapman & Hall 1997, 199–226

    Google Scholar 

  129. Solimanpur, M.; Vrat, P.; Shankar, R.: Ant colany optimization algorithm to the inter-cell layout problem in cellular manufacturing. Europ. J. of Operational Res. 157 (2004) 3, 592–606

    Article  MathSciNet  MATH  Google Scholar 

  130. Suresh, N.C.; Meredith, J.R.: Coping with the loss of pooling synergy in cellular manufacturing systems. Management Sci. 40 (1994) 4, 466–483

    Article  MATH  Google Scholar 

  131. Suri, R.; Desiraju, R.: Performance analysis of flexible manufacturing systems with a single discrete martial-handling device. Int. J. of Manufacturing Systems 9 (1997) 223–249

    Article  Google Scholar 

  132. Suresh, N.C.; Kay, J.U.: Group technology and cellular manufacturing: Updated perspectives. In: Suresh, N.C.; Kay, J.U. (eds.): Group technology and cellular manufacturing. Boston, MA. (USA): Kluwer 1998, 1 14

    Google Scholar 

  133. Tempelmeier, H.; Kuhn H.: Flexible Fertigungssysteme: Entscheidungsunterstützung für Konfiguration und Betrieb. Berlin: Springer 1993

    Google Scholar 

  134. Tempelmeier, H; Kuhn H.: Flexible manufacturing systems: Decision support for design and operation. New York: Wiley 1993

    Google Scholar 

  135. Tempelmeier, H.: Flexible Fertigungstechniken. In: Kern, W.; Schröder, H.-H.; Weber J. (Hrsg.): Handwörterbuch der Produktion. 2. Aufl. Stuttgart: Schäffer-Poeschel 1996, 501–512

    Google Scholar 

  136. Tempelmeier, H.; Kuhn, H.: Softwaretools zur Kapazitätsplanung flexibler Produktionssysteme. Industrie Management 12 (1996) 3, 29–33

    Google Scholar 

  137. Tetzlaff, U. A.W.: Optimal design of flexible manufacturing systems. Heidelberg: Physica 1990

    Google Scholar 

  138. Tetzlaff, U. A.W.: Evaluating the effect of tool management on flexible manufacturing system performance. Int. J. of Prod. Res. 33 (1995) 4, 877–892

    Article  MATH  Google Scholar 

  139. Venugopal, V: Soft computing-based approaches to the group technology problem: A state-of-the-art review. Int. J. of Prod. Res. 37 (1999) 14, 3335–3357

    Article  MATH  Google Scholar 

  140. Wemmerlöv, U.; Johnson D.J.: Cellular manufacturing at 46 user plants: implementation experiences and performance improvements. Int. J. of Prod. Res. 35 (1997) 4, 29–49

    MATH  Google Scholar 

  141. Wicks, E.M.; Reasor, R.J.: Designing cellular manufacturing systems with dynamic part populations. IIE Trans. 31 (1999) 11–20

    Google Scholar 

  142. Wu X.; Chu, C.H.; Wang, Y.; Yan, W.: A genetic algorithm for cellular manufacturing design and layout. Europ. J. of Operational Res. erscheint 2007

    Google Scholar 

  143. Yin Y.; Yasuda, K.: Simillarity coefficient methods applied to the cell formation problem: A taxonomy and review. Int. J. of Prod. Econom. 101 (2006) 2, 329–352

    Article  Google Scholar 

  144. Ahuja, R.K.; Magnanti, T.L.; Orlin J.B.: Network Flows. New Jersey: Prentice-Hall 1993

    Google Scholar 

  145. Amiri, A.; Pirkul, H.: New formulation and relaxation to solve a concave cost network flow problem. JORS 48 (1997) 278–287

    Article  MATH  Google Scholar 

  146. Baker, B.M.; Sheasby, J.: Extensions to the generalised assignment heuristic for vehicle routing. EJOR 119 (1999) 147–157

    Article  MATH  Google Scholar 

  147. Bertazzi, L.; Speranza, M.G.:Models and Algorithms for the Minimization of Inventory and Transportation Costs: A Survey. In: Speranza, M.G.; Stähly, P. (Eds.): New Trends in Distribution Logistics. Berlin: Springer 2000, S. 137–157

    Google Scholar 

  148. Büdenbender K.; Grünert T.; Sebastian H.-J.: A Hybrid Tabu Search Branch-and-Bound Algorithm for the Direct Flight Network Design Problem. Transp. Science 34 (2000) 364–380

    Article  MATH  Google Scholar 

  149. Clarke, G.; Wright, J.W.: Scheduling vehicles from a central delivery depot to a number of delivery points. ORQ 12 (1964) 568–581

    Google Scholar 

  150. Cordeau, J.-F.; Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. Information Systems and Operations Research 39 (2001) 292–298

    Google Scholar 

  151. Cordeau, J.-F.; Gendreau, M.; Laporte, G.; Potvin, J.-Y.; Semet, F.: A guide to vehicle routing heuristics. JORS 53 (2002) 512–522

    Article  MATH  Google Scholar 

  152. Cordeau, J.-F.; Gendreau, M.; Hertz, A.; Laporte, G.; Sormany, J.S.: New heuristics for the vehicle routing problem. Les Cahiers du GERAD, G-2004-33, HEC Montréal, 2004

    Google Scholar 

  153. Cordeau, J.-F.; Laporte, G.; Savelsbergh, M.W.P.; Vigo, D.; Vehicle Routing. In: Barnhart, C.; Laporte, G. (Eds.): Handbooks in Operations Research & Management Science (Vol. 14): Transportation. Amsterdam (Niederlande): North-Holland 2006, S. 367–428

    Google Scholar 

  154. Crainic, T.G.; Laporte, G.: Planning models for freight transportation. EJOR 97 (1997) 409–438

    Article  MATH  Google Scholar 

  155. Crainic, T.G.: Service network design in freight transportation. EJOR 122 (2000) 272–288

    Article  MATH  Google Scholar 

  156. Diks, E.B.; de Kok, A.G.: Transshipments in a divergent 2echelon distribution system. In: Fleischmann, B.; van Nunen, J.A.E.E. et al. (Eds.): Advances in Distribution Logistics. Berlin: Springer 1998, S. 423–448

    Google Scholar 

  157. Domschke, W.; Drexl, A.: Logistik: Standorte. 4. Aufl. München: Oldenbourg 1996

    Google Scholar 

  158. Domschke, W.: Logistik: Rundreisen und Touren. 4. Aufl. München: Oldenbourg 1997

    Google Scholar 

  159. Domschke, W.: Logistik: Transport. 5. Aufl. München: Oldenbourg 2007

    Google Scholar 

  160. Fisher, M.L.; Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11 (1981) 109–124

    Article  MathSciNet  Google Scholar 

  161. Fleischmann, B.: Designing distribution systems with transport economies of scale. EJOR 70 (1993) 31–42

    Article  MATH  Google Scholar 

  162. Fleischmann, B.: Design of Freight Traffic Networks. In: Fleischmann, B.; van Nunen, J.A.E.E. et al. (Eds.): Advances in Distribution Logistics. Berlin: Springer 1998, S. 55–81

    Google Scholar 

  163. Fleischmann, B.: Kooperation von Herstellern in der Konsumgüterdistribution. In: Engelhard, J., Sinz, E. (Hrsg.): Kooperation im Wettbewerb. Wiesbaden: Gabler 1999, S. 169–186

    Google Scholar 

  164. Fleischmann, B.: Transport and Inventory Planning with discrete Shipment Times. In: Speranza, M.G.; Stähly, P. (Eds.): New Trends in Distribution Logistics. Berlin: Springer 1999, S. 159–178

    Google Scholar 

  165. Fleischmann, B.; Gietz, M.; Gnutzmann, S.: Time varying travel times in vehicle routing. Transportation Science 38 (2004) 160–173

    Article  Google Scholar 

  166. Fleischmann, B.; Gnutzmann, S.; Sandvoß, E.: Dynamic vehicle routing based on online traffic information. Transportation Science 38 (2004) 420–433

    Article  Google Scholar 

  167. Gendreau, M.; Hertz, A.; Laporte, G.: A tabu search heuristic for the vehicle routing problem. Man. Sc. 40 (1994) 1276–1290

    MATH  Google Scholar 

  168. Geoffrion, A.M.; Powers, R.F.: Twenty years of strategic distribution systems design: an evolutionary perspective. Interfaces 25 (1995) 105–127

    Google Scholar 

  169. Gillett, B.; Miller, L.: A heuristic algorithm for the vehicle dispatching problem. ORQ 22 (1974) 340–349

    MATH  Google Scholar 

  170. Grünert, T.; Irnich, S.: Optimierung im Transport. Bd. I: Grundlagen. Shaker: Aachen 2005

    Google Scholar 

  171. Grünert, T.; Irnich, S.: Optimierung im Transport. Bd. II: Wege und Touren. Shaker: Aachen 2005

    Google Scholar 

  172. Haugland, D.; Ho, S.C.; Laporte, G.: Designing delivery districts for the vehicle routing problem with stochastic demands. Working paper, erscheint in EJOR 2005

    Google Scholar 

  173. Holmberg, K; Hellstrand, J.: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound. Operations Res. 46 (1998) 247–259

    MathSciNet  MATH  Google Scholar 

  174. Holmberg, K.; Yuan, D.: A Lagrangian Heuristic based Branch-and-Bound Approach for the capacitated network design problem. Operations Res. 48 (2000) 461–481

    Article  MathSciNet  MATH  Google Scholar 

  175. Irnich, S.; Funke, B.; Grünert, T.: Sequential search and its application to vehicle-routing problems. C & OR 33 (2006) 2405–2429

    MATH  Google Scholar 

  176. Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. Working paper, Deutsche Post, Lehrstuhl für Optimierung von Distributionsnetzwerken, RWTH Aachen 2006

    Google Scholar 

  177. Klose, A.; Drexl, A.: Facility location models for distribution system design. EJOR 162 (2005) 4–29

    Article  MathSciNet  MATH  Google Scholar 

  178. Kuby, M.J.; Gray, R.G.: The hub network design problem with stopover feeders: The case of Federal Express. Transp. Research A 27 (1993) 1–12

    Article  Google Scholar 

  179. Kytöjoki, J.; Nuortio, T.; Bräysy, O.; Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. C & OR 34 (2007) 2743–2757

    MATH  Google Scholar 

  180. Li, F.; Golden, B.; Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms, and results. C & OR 32 (2005) 1165–1179

    MATH  Google Scholar 

  181. Li, F.; Golden, B.; Wasil, E.: The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. C & OR 33 (2006) im Druck

    Google Scholar 

  182. Li, F.; Golden, B.; Wasil, E.: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. C & OR 34 (2007) 2734–2742

    MATH  Google Scholar 

  183. Liu, F.-H.F.; Shen, S.Y.: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. EJOR 118 (1999) 485–504

    Article  MATH  Google Scholar 

  184. Lu, Q.; Dessouky, M.M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. EJOR 175 (2006) 672–687

    Article  MATH  Google Scholar 

  185. Mester, D.; Bräysy, O.: Active guided evolution strategies for large-scale vehicle routing problems with time windows. C & OR 32 (2005) 1593–1614

    Google Scholar 

  186. Paraschis I.: Optimale Gestaltung von Mehrprodukt-Distributionssystemen: Modelle - Methode - Anwendungen. Heidelberg: Physica 1989

    Google Scholar 

  187. Pisinger, D.; Ropke, S.: A general heuristic for vehicle routing problems. C & OR 34 (2007) 2403–2435

    MathSciNet  MATH  Google Scholar 

  188. Potvin, J.-Y.; Xu, Y.; Benyahia, I.: Vehicle routing and scheduling with dynamic travel times. C & OR 33 (2006) 1129–1137

    MATH  Google Scholar 

  189. http://www.prologos.de vom 22.02.2007

    Google Scholar 

  190. Reimann, M.; Doerner, K.; Hartl, R.F.: D-ants: savings based ants divide and conquer for the vehicle routing problem. C & OR 31 (2004) 563–591

    MATH  Google Scholar 

  191. Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. C & OR 33 (2006) 894–909

    MATH  Google Scholar 

  192. Stumpf, P.: Tourenplanung in speditionellen Güterverkehrsnetzen. Nürnberg: GVB, Schriftenreihe Band 39, 1998

    Google Scholar 

  193. Toth, P.; Vigo, D. (Hrsg.): The Vehicle Routing Problem. SIAM: Philadelphia 2002

    MATH  Google Scholar 

  194. Wieberneit, N.: Service Network Design for Freight Transportation – A Review. erscheint in OR Spectrum 2007

    Google Scholar 

  195. http://www.wior.uni-karlsruhe.de/bibliothek/Vehicle/com vom 22.02.2007

    Google Scholar 

  196. Wlcek, H.: Gestaltung der Güterverkehrsnetze von Sammelgutspeditionen. Nürnberg: GVB, Schriftenreihe Band 37, 1998

    Google Scholar 

  197. Yan, S.; Luo, S.-C.: Probabilistic local search algorithms for concave cost transportation network problems. EJOR 117 (1999) 511–521

    Article  MATH  Google Scholar 

  198. Yan, S.; Juang, D.-S.; Chen, C.-R.; Lai, W.-S.: Global and Local Search Algorithms for Concave Cost Transhipment Problems. J. of Global Optimization 33 (2005) 123–156

    Article  MathSciNet  MATH  Google Scholar 

  199. Chen, F.; Zheng, Y.S.: Evaluating echelon stock (R,nQ) policies in serial production/inventory systems with stochastic demand. Management Sci. 40 (1994) 1262–1275

    MATH  Google Scholar 

  200. Dekker, R.; Fleischmann, M.; Inderfurth, K.; van Wassenhove, L.N.: Reverse Logistics – Quantitative Models for Closed-Loop Supply Chains. Berlin/Heidelberg/New York: Springer 2004

    Google Scholar 

  201. Diks, E.B.; de Kok, A.G.; Lagodimos, A.G.: Multi-echelon systems: A service measure perspective. Europ. J. of Operational Res. 95 (1996) 241–263

    Article  MATH  Google Scholar 

  202. Eppen, G.; Schrage, L.: Centralized ordering policies in a multi-warehouse system with lead times and random demand. In: Schwartz, L.B. (ed.): Multi-level production/inventory control systems: Theory and practice. Amsterdam: North-Holland 1981, 51–67

    Google Scholar 

  203. Grubbström, R.W.; Thorstenson, A.: Evaluation of capital costs in a multi-level inventory system by means of the annuity stream principle. Europ. J. of Operational Res. 24 (1986) 136–145

    Article  MATH  Google Scholar 

  204. Gurnani, C.: Economic analysis of inventory systems. Int. J. of Production Res. 21 (1983) 261–277

    Article  MATH  Google Scholar 

  205. van Houtum, G.J.; Inderfurth, K.; Zijm, W.H.M.: Materials coordination in stochastic multi-echelon systems. Europ. J. of Operational Res. 95 (1996) 1–23

    Article  MATH  Google Scholar 

  206. Inderfurth, K.: Safety stocks in multi-stage divergent inventory systems: A survey. Int. J. of Production Econom. 35 (1994) 321–329

    Article  Google Scholar 

  207. Inderfurth, K.: Lagerhaltungsmodelle. In: Kern, W. et al. (Hrsg.): Handwörterbuch der Produktionswirtschaft. 2. Aufl. Stuttgart: Schäffer-Poeschel 1996, 1024–1037

    Google Scholar 

  208. Jensen, T.: Planungsstabilität in der Material-Logistik. Heidelberg: Physica 1996

    Google Scholar 

  209. Küpper, H.-U.; Helber, St.: Ablauforganisation in Produktion und Logistik. 3. Aufl. Stuttgart: Schäffer-Poeschel 2004

    Google Scholar 

  210. Pfohl, H.-Ch.: Logistiksysteme. 7. Aufl. Berlin: de Gruyter 2004

    Google Scholar 

  211. Porteus, E.L.: Stochastic inventory theory. In: Heyman, D.P.; Sobel, M.J. (eds.): Handbooks in operations research and management science. Vol. 2. Amsterdam: Elsevier 1990, 605–652

    Google Scholar 

  212. Robrade, A.D.: Dynamische Einprodukt-Lagerhaltungsmodelle bei periodischer Bestandsüberwachung. Heidelberg: Physica 1991

    Google Scholar 

  213. Schneeweiß, Ch.: Modellierung industrieller Lagerhaltungssysteme. Berlin: Springer 1981

    MATH  Google Scholar 

  214. Silver, E.A.; Pyke, D.F.; Peterson, R.: Inventory management and production planning and scheduling. 3. Aufl. New York: Wiley & Sons 1998

    Google Scholar 

  215. Tempelmeier, H.: Material-Logistik – Modelle und Algorithmen für die Produktionsplanung und steuerung und das Supply Chain Management. 5. Aufl. Berlin: Springer 2003

    Google Scholar 

  216.  Tempelmeier, H.: Bestandsmanagement in Supply Chains. Norderstedt: Books on Demand 2005

    Google Scholar 

  217. Thonemann, U.: Operations Management. München: Pearson 2005

    Google Scholar 

  218. Bischoff, E.E.; Dowsland, W.B.: An application of the micro to product design and distribution. J. of the Operational Res. Soc. 33 (1982) 271–280

    Article  Google Scholar 

  219. Bischoff, E.E.; Marriott, M.D.: A comparative evaluation of heuristics for container loading. Europ. J. of Operational Res. 44 (1990) 267–276

    Article  MATH  Google Scholar 

  220. Bischoff, E.E.; Ratcliff, M.S.W.: Issues in the development of approaches to container loading. Omega 23 (1995) 377–390

    Article  Google Scholar 

  221. Bischoff, E.E.; Ratcliff, M.S.W.: Loading multi- ple pallets. J. of the Operational Res. Soc. 46 (1995) 1322–1336

    MATH  Google Scholar 

  222. Bischoff, E.E.; Janetz, F.; Ratcliff, M.S.W.: Loading pallets with non-identical items. Europ. J. of Operational Res. 84 (1995) 681–692

    Article  MATH  Google Scholar 

  223. Bischoff, E.E.: Palletisation efficiency as a criterion for product design. OR Spektrum 19 (1997) 139–145

    MathSciNet  MATH  Google Scholar 

  224. Bischoff, E.E.: Three-dimensional packing of items with limited load bearing strength. Europ. J. of Operational Res. 168 (2006) 952–966

    Article  MATH  Google Scholar 

  225. Bortfeldt, A.: Eine Heuristik für Multiple Containerbeladungsprobleme. Diskussionsbeitrag Nr. 257 (10/1998), FB Wirtschaftswissenschaft, Fern-Univ. Hagen 1998

    Google Scholar 

  226. Bortfeld, A.; Gehring, H.: A hybrid genetic algorithm for the container loading problem. Europ. J. of Operational Res. 131 (2001) 143–161

    Article  Google Scholar 

  227. Carpenter, H.; Dowsland, W.B.: Practical considerations of the pallet loading problem. J. of the Operational Res. Soc. 36 (1985) 489–497

    Article  MATH  Google Scholar 

  228. Chen, C.S.; Lee, S.M.; Shen, Q.S.: An analytical model for the container loading problem. Europ. J. of Operational Res. 80 (1995) 68–76

    Article  MATH  Google Scholar 

  229. Correia, M.H.; Oliviera, J.F.; Ferreira, J.S.: Cylinder packing by simulated annealing. Pesquisa Operacional 20 (2000) 269–286

    Article  Google Scholar 

  230. Davies, A.P.; Bischoff, E.E.: Weight distribution considerations in container loading. Europ. J. of Operational Res. 114 (1999) 509–527

    Article  MATH  Google Scholar 

  231. Dowsland, K.A.: The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. J. of the Operational Res. Soc. 35 (1984) 895–905

    Article  MATH  Google Scholar 

  232. Dowsland, K.A.: A graph-theoretic approach to a pallet loading problem. New Zealand Operational Res. 13 (1985) 77–86

    MathSciNet  Google Scholar 

  233. Dowsland, K.A.: An exact algorithm for the pallet loading problem. Europ. J. of Operational Res. 31 (1987) 78–84

    Article  MathSciNet  MATH  Google Scholar 

  234. Dowsland, W.B.: Sensitivity analysis for pallet loading. OR Spektrum 13 (1991) 198–203

    Article  MATH  Google Scholar 

  235. Dyckhoff, H.: A typology of cutting and packing problems. Europ. J. of Operational Res. 44 (1990) 145–159

    Article  MathSciNet  MATH  Google Scholar 

  236. Eley, M.: Solving container loading problems by block arrangement. Europ. J. of Operational Res. 141 (2002) 393–409

    Article  MathSciNet  MATH  Google Scholar 

  237. Exeler, H.: Das homogene Packproblem in der betriebswirtschaftlichen Logistik. Heidelberg: Physica 1988

    Google Scholar 

  238. Gehring, H.; Menschner, K.; Meyer, M.: A computer-based heuristic for packing pooled shipment containers. Europ. J. of Operational Res. 44 (1990) 277–288

    Article  MATH  Google Scholar 

  239. Gehring, H.; Bortfeld, A.: A genetic algorithm for solving the container loading problem. Int. Trans. in Operational Res. 4 (1997) 401–418

    Article  MATH  Google Scholar 

  240. George, J.A.; Robinson, D.F.: A heuristic for packing boxes into a container. Computers and Operations Res. 7 (1980) 147–156

    Article  Google Scholar 

  241. George, J.A.: A method for solving container packing for a single size of box. J. of the Operational Res. Soc. 43 (1992) 307–312

    MATH  Google Scholar 

  242. George, J.A.; George, J.M.; Lamar, B.W.: Packing different-sized circles into a rectangular container. Europ. J. of Operational Res. 84 (1995) 693–712

    Article  MATH  Google Scholar 

  243. Hemminki, J.; Leipälä, T.; Nevalainen, O.: Online packing with boxes of different sizes. Int. J. of Production Res. 36 (1998) 2225– 2245

    Article  MATH  Google Scholar 

  244. Hifi, M.; M’Hallah, R.: Approximate algorithms for constrained circular cutting problems. Computers & Operational Res. 31 (2004) 675–694

    Article  MATH  Google Scholar 

  245. Isermann, H.: Ein Planungssystem zur Optimierung der Palettenbeladung mit kongruent rechteckigen Versandgebinden. OR Spektrum 9 (1987) 235–249

    Article  Google Scholar 

  246. Isermann, H.: Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. OR Spektrum 13 (1991) 213–223

    Article  MATH  Google Scholar 

  247. Isermann, H.: Stauraumplanung. In: Logistik (Hrsg.: H. Isermann). 2. Aufl. Landsberg a. Lech: moderne industrie 1998, 245–286

    Google Scholar 

  248. Kling, K.: Computergestützte dreidimensionale Stauraumoptimierung in Theorie und Praxis. Dipl.-arb., Lehrgebiet Wirtschaftsinformatik, FB Wirtschaftswissenschaft, Fern-Univ. Hagen 1998

    Google Scholar 

  249. Liu, N.-C.; Chen, L.-C.: A new algorithm for container loading. 5th Int. Computer Software and Application Conf. of the IEEE: New York, 1981, 292–299

    Google Scholar 

  250. Liu, F.-H.F.; Hsiao, C.-J.: A three-dimensional pallet loading method for single-size boxes. J. of the Operational Res. Soc. 48 (1997) 726–735

    MATH  Google Scholar 

  251. Martello, S.; Toth, P.: Knapsack problems – Algorithms and computer implementations. Chichester (UK), Wiley 1990

    MATH  Google Scholar 

  252. Morabito, R.; Morales, S.: A simple and effective recursive procedure for the manufacturer’s pallet loading problem. J. of the Operational Res. Soc. 49 (1998) 819–828

    MATH  Google Scholar 

  253. Naujoks, G.: Optimale Stauraumnutzung. Wiesbaden: Dt. Univ.-Verl. 1995

    Google Scholar 

  254. Nelißen, J.: Neue Ansätze zur Lösung des Palettenbeladungsproblems. Aachen: Shaker 1995

    Google Scholar 

  255. Pisinger, D.: Heuristics for the container loading problem. Europ. J. of Operational Res. 141 (2002) 382–392

    Article  MathSciNet  MATH  Google Scholar 

  256. Ratcliff, M.S.W.; Bischoff, E.E.: Allowing for weight considerations in container loading. OR Spektrum 20 (1998) 65–71

    Article  MATH  Google Scholar 

  257. Schrijver, A.: Theory of linear and integer programming. Nachdruck der Auflage von 1987. Chichester (UK): Wiley 1994

    Google Scholar 

  258. Scheithauer, G.: LP-based bounds for the container and multi-container loading problem. Int. Trans. in Operational Res. 6 (1999) 199–213

    Article  MathSciNet  Google Scholar 

  259. Smith, A.; De Cani, P. (1980): An algorithm to optimize the layout of boxes in pallets. J. of the Operational Res. Soc. 31 (1980) 573–578

    Article  Google Scholar 

  260. Sommerweiß, U.: Modeling of practical requirements of the distributer’s packing problem. Operations Res. Proc. 1995 (eds: P. Kleinschmidt et al.). Berlin: Springer 1996, 427–432

    Google Scholar 

  261. Wäscher, G.; Haußner, H.; Schumann, H.: An improved typology of cutting and packing problems. Europ. J. of Operational Res. In Press, Corrected Proof available online 19 June 2006 at http://www.sciencedirect.com

    Google Scholar 

Download references

Editor information

Editors and Affiliations

  1. Institut für Fördertechnik und Logistiksysteme, Universität Karlsruhe (TH), Gotthard-Franz-Str. 8, Geb. 50.38, 76128, Karlsruhe, Deutschland

    Dieter Arnold

  2. FB Wirtschaftswissenschaften, Johann Wolfgang Goethe-Universität, Mertonstraße 17, 60054, Frankfurt/Main, Deutschland

    Heinz Isermann

  3. Fraunhofer Institut Materialfluss und Logistik (IML), Universität Dortmund, Joseph-von-Fraunhofer-Straße 2–4, 44227, Dortmund, Deutschland

    Axel Kuhn

  4. Seminar für Supply Chain Management und Produktion, Universität zu Köln, Albertus-Magnus-Platz 1, 50923, Köln, Deutschland

    Horst Tempelmeier

  5. Institut für Fördertechnik und Logistiksysteme, Stiftungslehrstuhl Logistik, Universität Karlsruhe (TH), Gotthard-Franz-Str. 8, Geb. 50.38, 76128, Karlsruhe, Deutschland

    Kai Furmans

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Planung logistischer Systeme. In: Arnold, D., Isermann, H., Kuhn, A., Tempelmeier, H., Furmans, K. (eds) Handbuch Logistik. VDI-Buch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72929-7_3

Download citation

Publish with us

Policies and ethics

Search

Navigation