Mathematical Tools in Production Management: Competitive Methods in Operations Research and Data Analysis
Autor Jean-Marie Proth, Herve P. Hillionen Limba Engleză Paperback – 6 iul 2012
Preț: 385.61 lei
Nou
Puncte Express: 578
Preț estimativ în valută:
73.81€ • 77.43$ • 61.23£
73.81€ • 77.43$ • 61.23£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461595601
ISBN-10: 1461595606
Pagini: 408
Ilustrații: XIV, 391 p.
Greutate: 0.54 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer Us
Colecția Springer
Seria Competitive Methods in Operations Research and Data Analysis
Locul publicării:New York, NY, United States
ISBN-10: 1461595606
Pagini: 408
Ilustrații: XIV, 391 p.
Greutate: 0.54 kg
Ediția:Softcover reprint of the original 1st ed. 1990
Editura: Springer Us
Colecția Springer
Seria Competitive Methods in Operations Research and Data Analysis
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1 New Trends in Manufacturing Systems and Their Consequences.- 1.1. Main Changes in the Manufacturing Environment.- 1.2. Toward Flexibility, Modularity, and Integration.- 1.3. Flexible Manufacturing Systems (FMSs).- 1.4. Evaluation Criteria of Modern Production Systems.- 1.5. Evaluation Tools for Modern Production Systems.- 1.6. Production System Life Cycle.- 2 Preliminary Design of Production Systems.- 2.1. Static Study.- 2.2. Dynamic Study.- 3 Linear Programming.- 3.1. Linear Programming Formulations.- 3.2. LP Problems in Production Management.- 3.3. Conclusion.- 4 Dynamic Programming.- 4.1. Dynamic Programming Formulation.- 4.2. Dynamic Inventory Planning Problem.- 4.3. Task Scheduling.- 4.3.1. Stating the PERT Problem.- 4.3.2. Graphic Representation.- 4.3.3. Computation of Activity Completion Times in PERT.- 4.3.4. Computation of the Optimal Solution.- 5 Branch-and-Bound Techniques.- 5.1. Branch-and-Bound Techniques.- 5.2. Algorithms and Examples.- 5.3. Conclusion.- 6 Markov Chains.- 6.1. Formal Definition of a Discrete Parameter Markov Chain.- 6.2. Chapman-Kolmogorov Equations.- 6.3. Classification of States.- 6.4. Decomposition of the State-Space.- 6.5. Long-Run Properties of Irreducible Markov Chains.- 6.6. Application.- 6.7. Continuous Parameter Markov Chains.- 6.8. Long-Run Properties of Continuous Parameter Markov Chains.- 6.9. Birth and Death Processes.- 6.10. Pure Birth Processes.- 7 Queueing Theory.- 7.1. Structure of Queueing Models.- 7.2. Terminology and Notation.- 7.3. Elementary Queueing Models.- 7.4. Queueing Networks.- 7.5. Model Applicability.- 8 Petri Nets.- 8.1. Petri Net Theory.- 8.2. Petri Net Model of the Job Shop.- 8.3. Performance Evaluation.- 8.4. Optimal Control of the Job Shop.- 8.5. Model Applicability.- 9 Graph Theory.- 9.1. Basic Terminology and Notation.- 9.2. The Shortest Path Problem.- 9.3. The Maximal Flow Problem.- 9.4. Conclusion.- 10 Data Analysis.- 10.1. Definitions, Notation, and Basic Concepts.- 10.2. Main Component Analysis (MCA).- 10.3. Clustering Analysis.- 10.4. Conclusion.- 11 Mathematical Analysis of Automated Systems: Two Examples.- 11.1. Mathematical Modeling and Analysis.- 11.2. Transfer Line with Unreliable Machines and Transportation System.- 11.3. Closed-Loop Conveyor System.- 11.4. Conclusion.- References.