Modellbasiertes Logistikmanagement - Prof. Dr. Heinz-Michael ...

Modellbasiertes LogistikmanagementLLagerkosten................................................................ 56Längengrad ................................................................ 64Latitude...................................................................... 64LE 56Lebensmittelindustrie ................................................. 15lineare Optimierung ................................................... 39logische Bedingungen ................................................. 46Logistikeinheiten ........................................................ 56Logistikkosten ............................................................ 56logistische Versorgungskette ........................................ 2Longitude ................................................................... 64Lösungsgenerator ....................................................... 12MMatching .................................................................. 489minimales Kosten Matching ................................. 489mathematische Optimierung ...................................... 35mathematisches Modell ............................................... 1Matrixbezeichnung ..................................................... 20Matrixminimum-Verfahren ....................................... 110maximaler Fluss ........................................................ 164Maximum ................................................................... 36Maximum-Benefit-Briefträgerproblem ...................... 618Maximum-Covering-Location-Problem ...................... 374m-Briefträgerproblem .............................................. 618Median1.Median in der Ebene......................................... 4031-Median im Netzwerk ........................................ 381p-Median im Netzwerk ........................................ 383p-Median-Problem im Koordinatensystem ........... 415MedianeMediane im Netzwerk ......................................... 381Mehrdepotproblem .................................................. 586Mehrperiodenproblem ............................................. 587Miller-Tucker-Zemlin ................................................ 444Mineralölindustrie ........................................................ 4Minimum ................................................................... 36MINV(A) ..................................................................... 29MKM ........................................................................ 489MMULT(A,B) .............................................................. 28Modellgenerator ........................................................ 12MODI-Verfahren ......................................................... 78Monitoring ................................................................. 17MS Excel 2003 .......................................................... 619MS Excel 2010 .......................................................... 637MSB ......................................................................... 489MTRANS(A) ................................................................ 22MTZ-Bedingung ........................................................ 444verallgemeinert ................................................... 517NNachfolger ................................................................. 32Nebenbedingung ........................................................ 35Netz ........................................................................... 31Netzflussmodell........................................................ 143Netzwerk ................................................................... 31nichtlineare Optimierung ............................................ 42Nicht-Negativitätsbedingung ...................................... 40Nordwestecken-Regel............................................... 109OOpen Office .............................................................. 658Optimierungskriterium ......................................... 35, 54Optimum.................................................................... 35PPetal-Algorithmen .................................................... 555Pfad ........................................................................... 32Pfeil ........................................................................... 31Polarwinkel .............................................................. 466Premium-Solver........................................................ 649MS-Excel 2003 ..................................................... 630Prim-Algorithmus ..................................................... 489QQuadratischer Abstand ............................................... 72Quelle ........................................................................ 32RReflexivität ................................................................. 72Reportgenerator......................................................... 12Repsol Butano ........................................................ 4, 18Restriktion ................................................................. 35Rural Postman Problem ............................................ 618SSatz des Pythagoras .................................................... 67Savings-Verfahren .................................................... 535Senke ......................................................................... 32Set-Covering-Location-Problem ................................ 363Single-Source-Transportmodell ................................. 218Small-L ....................................................................... 49SOL .............................................................................. 7Spaltenbezeichnung ................................................... 20Spaltenindex .............................................................. 19Spaltenminimum-Verfahren ..................................... 109sphärische Trigonometrie ........................................... 68Standard-SolverMS-Excel 2003 ..................................................... 625MS-Excel 2010 ..................................................... 643Standortoptimierung ................................................ 330Standortplanungdiskret ................................................................. 330kontinuierlich ...................................................... 330Steiner-Weber-Modell .............................................. 403Supply Chain ................................................................ 2Sweep-Verfahren ..................................................... 549Symmetrie ................................................................. 72TT_XxxYyy .................................................................... 20Tabelle ....................................................................... 19Tourenplanungkapazitätsbeschränkt ........................................... 514kapazitätsbeschränkt mit Zeitfenster ................... 567TourenplanungsproblemeHeuristiken.......................................................... 535Transportkosten ......................................................... 56150