Skip to main content
Fachgebiete
Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Weitere Formate
Webinare Technik
Webinare Wirtschaft
Kongresse
Veranstaltungskalender
Podcasts
Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen beantragen
Erweiterte Suche
Anmelden
nach oben

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

Erschienen in:
Einführung in Logistik und Supply Chain Management Kapitel lesen Erstes Kapitel lesen

2023 | OriginalPaper | Buchkapitel

4. Bestandsplanung und Losgrößenbestimmung

verfasst von : Thomas Hanne, Rolf Dornberger

Erschienen in: Computational Intelligence in Logistik und Supply Chain Management

Verlag: Springer International Publishing

Einloggen, um Zugang zu erhalten

Zusammenfassung

In diesem Kapitel werden Probleme der Bestandsplanung und damit zusammenhängende Planungsaufgaben wie die Bestimmung von Losgrößen für die Beschaffung oder Produktion erörtert. Nach einer Begründung der Bedeutung der Bestandsplanung werden zunächst grundlegende Modelle für das Management von Beständen wie die bekannte Gleichung zur Berechnung wirtschaftlicher Bestellmengen erörtert. Danach werden komplexere Modelle zur Losgrößenermittlung und entsprechende Lösungsansätze aus der Computational Intelligence diskutiert. Anschließend werden einige detailliertere Probleme bei der operativen Lagerplanung und Fragen zur Bestimmung von Lagerorten behandelt. Im letzten Abschnitt dieses Kapitels werden einige Inventory-Routing-Modelle diskutiert, die die Planung von Lagerbeständen mit der Planung von Transportaufgaben kombinieren.

Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe



 


Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren
Vorheriges Kapitel Transportprobleme
Nächstes Kapitel Scheduling
Literatur
Absi, N., & Kedad-Sidhoum, S. (2008). The multi-item capacitated lot-sizing problem with setup times and shortage costs. European Journal of Operational Research, 185(3), 1351–1374. CrossRef
Akrami, B., Karimi, B., & Hosseini, S. M. (2006). Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case. Applied Mathematics and Computation, 183(1), 634–645. CrossRef
Almada-Lobo, B., & James, R. J. (2010). Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal of Production Research, 48(3), 861–878. CrossRef
Andler, K. (1929). Rationalisierung der Fabrikation und optimale Losgröße. Oldenbourg. CrossRef
Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. G. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3), 382–391. CrossRef
Arkin, E., Joneja, D., & Roundy, R. (1989). Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8(2), 61–66. CrossRef
Berretta, R., & Rodrigues, L. F. (2004). A memetic algorithm for a multistage capacitated lot-sizing problem. International Journal of Production Economics, 87(1), 67–81. CrossRef
Berretta, R., França, P. M., & Armentano, V. A. (2005). Metaheuristic approaches for the multilevel resource-constrained lot-sizing problem with setup and lead times. Asia-Pacific Journal of Operational Research, 22(02), 261–286. CrossRef
Bertazzi, L., & Speranza, M. G. (2002). Continuous and discrete shipping strategies for the single link problem. Transportation Science, 36(3), 314–325. CrossRef
Bertazzi, L., & Speranza, M. G. (2012). Inventory routing problems: An introduction. EURO Journal on Transportation and Logistics, 1(4), 307–326. CrossRef
Bertazzi, L., Bosco, A., Guerriero, F., & Lagana, D. (2013). A stochastic inventory routing problem with stock-out. Transportation Research Part C: Emerging Technologies, 27, 89–107. CrossRef
Brahimi, N., Dauzere-Peres, S., Najid, N. M., & Nordli, A. (2006). Single item lot sizing problems. European Journal of Operational Research, 168(1), 1–16. CrossRef
Buschkühl, L., Sahling, F., Helber, S., & Tempelmeier, H. (2010). Dynamic capacitated lot-sizing problems: A classification and review of solution approaches. OR Spectrum, 32(2), 231–261. CrossRef
Campbell, A. M., & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488–502. CrossRef
Caserta, M., & Rico, E. Q. (2009). A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Computers & Operations Research, 36(2), 530–548. CrossRef
Chen, L., Langevin, A., & Riopel, D. (2011). A tabu search algorithm for the relocation problem in a warehousing system. International Journal of Production Economics, 129(1), 147–156. CrossRef
Chopra, S., Reinhardt, G., & Dada, M. (2004). The effect of lead time uncertainty on safety stocks. Decision Sciences, 35(1), 1–24. CrossRef
Clark, A. R. (2000). A local search approach to lot sequencing and sizing. In M. Tucci & M. Garetti (Hrsg.), Proceedings of the third international workshop of the IFIP WG 5.7 special interest group on „Advanced techniques in production planning & control“ (S. 145–152). Firenze University Press.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2013). Thirty years of inventory routing. Transportation Science, 48(1), 1–19. CrossRef
Dellaert, N., Jeunet, J., & Jonard, N. (2000). A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. International Journal of Production Economics, 68(3), 241–257. CrossRef
Dye, C. Y., & Hsieh, T. P. (2013). A particle swarm optimization for solving lot-sizing problem with fluctuating demand and preservation technology cost under trade credit. Journal of Global Optimization, 55(3), 655–679. CrossRef
Florian, M., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1980). Deterministic production planning: Algorithms and complexity. Management Science, 26(7), 669–679. CrossRef
França, P. M., Armentano, V. A., Berretta, R. E., & Clark, A. R. (1997). A heuristic method for lot-sizing in multi-stage systems. Computers & Operations Research, 24(9), 861–874. CrossRef
Gaafar, L. (2006). Applying genetic algorithms to dynamic lot sizing with batch ordering. Computers & Industrial Engineering, 51(3), 433–444. CrossRef
García, I., Pacheco, J., & Alvarez, A. (2013). Optimizing routes and stock. Journal of Heuristics, 19(2), 157–177. CrossRef
Giannoccaro, I., & Pontrandolfo, P. (2002). Inventory management in supply chains: A reinforcement learning approach. International Journal of Production Economics, 78(2), 153–161. CrossRef
Giannoccaro, I., Pontrandolfo, P., & Scozzi, B. (2003). A fuzzy echelon approach for inventory management in supply chains. European Journal of Operational Research, 149(1), 185–196. CrossRef
Goetschalckx, M., & Ratliff, H. D. (1990). Shared storage policies based on the duration stay of unit loads. Management Science, 36(9), 1120–1132. CrossRef
Gopalakrishnan, M., Ding, K., Bourjolly, J. M., & Mohan, S. (2001). A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science, 47(6), 851–863. CrossRef
Goren, H. G., Tunali, S., & Jans, R. (2010). A review of applications of genetic algorithms in lot sizing. Journal of Intelligent Manufacturing, 21(4), 575–590. CrossRef
Harris, F. W. (1913). How many parts to make at once. Factory, The Magazine of Management, 10(2), 135–136, 152, reprinted in Operations Research, 38(6), 947–950.
Heskett, J. L. (1963). Cube-per-order index-a key to warehouse stock location. Transportation and Distribution Management, 3(1), 27–31.
van Hoek, R. I. (2001). The rediscovery of postponement. A literature review and directions for research. Journal of Operations Management, 19, 161–184.
Homberger, J. (2008). A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem. INFORMS Journal on Computing, 20(1), 124–132. CrossRef
Homberger, J. (2010). Decentralized multi-level uncapacitated lot-sizing by automated negotiation. 4OR: A Quarterly Journal of Operations Research, 8(2), 155–180. CrossRef
Hu, W., Wang, Y., & Zheng, J. (2012). Research on warehouse allocation problem based on the Artificial Bee Colony inspired particle swarm optimization (ABC-PSO) algorithm. In 5th International Symposium in Computational Intelligence and Design (ISCID) (Bd. 1, S. 173–176). IEEE.
Huang, S. H., & Lin, P. C. (2010). A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty. Transportation Research Part E: Logistics and Transportation Review, 46(5), 598–611. CrossRef
Jans, R., & Degraeve, Z. (2007). Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research, 177(3), 1855–1875. CrossRef
Kämpf, M., & Köchel, P. (2006). Simulation-based sequencing and lot size optimisation for a production-and-inventory system with multiple items. International Journal of Production Economics, 104(1), 191–200. CrossRef
Kang, J. H., & Kim, Y. D. (2010). Coordination of inventory and transportation managements in a two-level supply chain. International Journal of Production Economics, 123(1), 137–145. CrossRef
Karimi, B., Ghomi, S. F., & Wilson, J. M. (2003). The capacitated lot sizing problem: A review of models and algorithms. Omega, 31(5), 365–378. CrossRef
Kofler, M., Beham, A., Wagner, S., Affenzeller, M., & Achleitner, W. (2011). Re-warehousing vs. healing: Strategies for warehouse storage location assignment. In 3rd IEEE international symposium on logistics and industrial informatics (S. 77–82). IEEE. CrossRef
Lee, Y. H., Jung, J. W., & Lee, K. M. (2006). Vehicle routing scheduling for cross-docking in the supply chain. Computers & Industrial Engineering, 51(2), 247–256. CrossRef
Li, M., Chen, X., & Liu, C. (2008). Pareto and niche genetic algorithm for storage location assignment optimization problem. In 3rd International Conference in Innovative Computing Information and Control. ICICIC’08 (S. 465). IEEE.
Liu, S. C., & Chen, J. R. (2011). A heuristic method for the inventory routing and pricing problem in a supply chain. Expert Systems with Applications, 38(3), 1447–1456. CrossRef
Mateus, G. R., Ravetti, M. G., de Souza, M. C., & Valeriano, T. M. (2010). Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration. Journal of Scheduling, 13(3), 245–259. CrossRef
Mishra, N., Kumar, V., Kumar, N., Kumar, M., & Tiwari, M. K. (2011). Addressing lot sizing and warehousing scheduling problem in manufacturing environment. Expert Systems with Applications, 38(9), 11751–11762. CrossRef
Moin, N. H., & Salhi, S. (2007). Inventory routing problems: A logistical overview. Journal of the Operational Research Society, 58(9), 1185–1194. CrossRef
Muller, L. F., Spoorendonk, S., & Pisinger, D. (2012). A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. European Journal of Operational Research, 218(3), 614–623. CrossRef
Muppani, V. R., & Adil, G. K. (2008). Efficient formation of storage classes for warehouse storage location assignment: a simulated annealing approach. Omega, 36(4), 609–618.
Nascimento, M. C., Resende, M. G., & Toledo, F. M. (2010). GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research, 200(3), 747–754. CrossRef
Park, C., & Seo, J. (2010). Comparing heuristic algorithms of the planar storage location assignment problem. Transportation Research Part E: Logistics and Transportation Review, 46(1), 171–185. CrossRef
Pitakaso, R., Almeder, C., Doerner, K. F., & Hartl, R. F. (2006). Combining population-based and exact methods for multi-level capacitated lot-sizing problems. International Journal of Production Research, 44(22), 4755–4771. CrossRef
Robinson, P., Narayanan, A., & Sahin, F. (2009). Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms. Omega, 37(1), 3–15. CrossRef
Silver, E. A., & Meal, H. C. (1973). A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management, 14(2), 64–74.
Sindhuchao, S., Romeijn, H. E., Akçali, E., & Boondiskulchok, R. (2005). An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity. Journal of Global Optimization, 32(1), 93–118. CrossRef
Speranza, M. G., & Ukovich, W. (1994). Minimizing transportation and inventory costs for several products on a single link. Operations Research, 42(5), 879–894. CrossRef
Staggemeier, A., Clarke, A., Aickelin, U., & Smith, J. (2002). A hybrid genetic algorithm to solve a lot sizing and scheduling problem. Internal research report MS-2002-4. University of the West of England.
Toptal, A., Koc, U., & Sabuncuoglu, I. (2013). A joint production and transportation planning problem with heterogeneous vehicles. Journal of the Operational Research Society, 65(2), 180–196. CrossRef
Torabi, S. A., Ghomi, S. F., & Karimi, B. (2006). A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. European Journal of Operational Research, 173(1), 173–189. CrossRef
Vidović, M., Popović, D., & Ratković, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics, 147, 593–604. CrossRef
Wagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89–96. CrossRef
Waters-Fuller, N. (1995). Just-in-time purchasing and supply: A review of the literature. International Journal of Operations & Production Management, 15(9), 220–236. CrossRef
Woarawichai, C., Kullpattaranirun, T., & Rungreunganun, V. (2011). Inventory lot-sizing problem with supplier selection under storage space and budget constraints. IJCSI International Journal of Computer Science Issues, 8(2), 250–255.
Xie, J., & Dong, J. (2002). Heuristic genetic algorithms for general capacitated lot-sizing problems. Computers & Mathematics with Applications, 44(1), 263–276. CrossRef
Zhao, Q. H., Wang, S. Y., & Lai, K. K. (2007). A partition approach to the inventory/routing problem. European Journal of Operational Research, 177(2), 786–802. CrossRef
Zhao, Q. H., Chen, S., & Zang, C. X. (2008). Model and algorithm for inventory/routing decision in a three-echelon logistics system. European Journal of Operational Research, 191(3), 623–635. CrossRef
Metadaten
Titel
Bestandsplanung und Losgrößenbestimmung
verfasst von
Thomas Hanne
Rolf Dornberger
Copyright-Jahr
2023
Buch
Computational Intelligence in Logistik und Supply Chain Management

Print ISBN: 978-3-031-21451-6

Electronic ISBN: 978-3-031-21452-3

Copyright-Jahr: 2023

DOI
https://doi.org/10.1007/978-3-031-21452-3_4

Premium Partner

Pluta
    Bildnachweise