Optimization tools for logistics /

Optimization Tools for Logistics covers the theory and practice of the main principles of operational research and the ways it can be applied to logistics and decision support with regards to common software. The book is supported by worked problems and examples from industrial case studies, providi...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Reveillac, Jean-Michel
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Kidlington, Oxford : ISTE Press, Ltd ; Elsevier, 2015.
Temas:
Operations research.
Operations Research
Recherche op�erationnelle.
BUSINESS & ECONOMICS > Industrial Management.
BUSINESS & ECONOMICS > Management.
BUSINESS & ECONOMICS > Management Science.
BUSINESS & ECONOMICS > Organizational Behavior.
Operations research
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Front Cover
  • Optimization Tools for Logistics
  • Copyright
  • Contents
  • Foreword
  • About This Book
  • Introduction
  • Chapter 1: Operational Research
  • 1.1. A History
  • 1.2. Fields of Application, Principles and Concepts
  • 1.3. Basic Models
  • 1.4. The Future of OR
  • Chapter 2: Elements of Graph Theory
  • 2.1. Graphs and Representations
  • 2.2. Undirected Graph
  • 2.3. Directed Graph or Digraph
  • 2.4. Graphs for Logistics
  • Chapter 3: Optimal Paths
  • 3.1. Basic Concepts.
  • 3.2. Dijkstra's Algorithm
  • 3.3. Flyod-Warshall's Algorithm
  • 3.4. Bellman-Ford's Algorithm
  • 3.5. Bellman-Ford's Algorithm with a Negative Circuit
  • 3.6. Exercises
  • Chapter 4: Dynamic Programming
  • 4.1. The Principles of Dynamic Programming
  • 4.2. Formulating the Problem
  • 4.3. Stochastic Process
  • 4.4. Markov Chains
  • 4.5. Exercises
  • Chapter 5: Scheduling with PERT and MPM
  • 5.1. The Main Concepts
  • 5.2. Critical Path Method
  • 5.3. Precedence Diagram
  • 5.4. Planning a Project with PERT/CPM
  • 5.5. Example of Determining at Critical Path with PERT.
  • 5.6. Slacks
  • 5.7. Example of Calculating Slacks
  • 5.8. Determining the Critical Path with a Double-Entry Table
  • 5.9. Methodology for Planning with MPM
  • 5.10. Example of Determining a Critical Path with MPM
  • 5.11. Probabilistic PERT/CPM/MPM
  • 5.12. Gantt Chart
  • 5.13. PERT-MPM Costs
  • 5.14. Exercises
  • Chapter 6: Maximum Flow in a Network
  • 6.1. Maximum Flow
  • 6.2. Ford-Fulkerson Algorithm
  • 6.3. Minimum Cut Theorem
  • 6.4. Dinic3 Algorithm
  • 6.5. Exercises.
  • Chapter 7: Trees, Tours and Transport
  • 7.1. Fundamental Concepts
  • 7.2. Kruskal's Algorithm
  • 7.3. Prim's Algorithm
  • 7.4. Sollin's Algorithm
  • 7.5. Little's Algorithm for Solving the TSP
  • 7.6. Exercises
  • Chapter 8: Linear Programming
  • 8.1. Fundamental Concepts
  • 8.2. Graphic Solution Method
  • 8.3. Simplex Method
  • 8.4. Duality
  • 8.5. Exercises
  • Chapter 9: Software
  • 9.1. Software for OR and Logistics
  • 9.2. Spreadsheets
  • 9.3. Project Managers
  • 9.4. Flow Simulators.
  • Chapter 10: Operational Research Using a Spreadsheet
  • 10.1. Note
  • 10.2. Dynamic Programming
  • 10.3. Scheduling
  • 10.4. Maximal Flows
  • 10.5. Transport Model
  • 10.6. Linear Programming
  • Chapter 11: Dashboards, Spreadsheets and Pivot Tables
  • 11.1. The Spreadsheet: A Versatile Tool
  • 11.2. The Database: Example
  • 11.3. Multiple Databases
  • 11.4. Limits to and Constraints on Calculated Fields
  • 11.5. Conclusion.

Ejemplares similares