Cantitate/Preț
Produs

Network Scheduling Techniques for Construction Project Management: Nonconvex Optimization and Its Applications, cartea 16

Autor M. Hajdu
en Limba Engleză Hardback – 31 dec 1996
Industrial, financial, commercial or any kinds of project have at least one common feature: the better organized they are, the higher the profit or the lower the cost. Project management is the principle of planning different projects and keeping them on track within time, cost and resource constraints. The need for effective project management is ever-increasing. The complexity of the environment we live in requires more sophisticated methods than it did just a couple of decades ago. Project managers might face insurmountable obstacles in their work if they do not adapt themselves to the changing circumstances. On the other hand, better knowledge of project management can result in better plans, schedules and, last but not least, more contracts and more profit. This knowledge can help individuals and firms to stay alive in this competitive market and, in the global sense, utilize the finite resources of our planet in a more efficient way.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 94718 lei  43-57 zile
  Springer Us – 7 dec 2010 94718 lei  43-57 zile
Hardback (1) 95525 lei  43-57 zile
  Springer Us – 31 dec 1996 95525 lei  43-57 zile

Din seria Nonconvex Optimization and Its Applications

Preț: 95525 lei

Preț vechi: 116493 lei
-18% Nou

Puncte Express: 1433

Preț estimativ în valută:
18279 19133$ 15214£

Carte tipărită la comandă

Livrare economică 31 martie-14 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792343097
ISBN-10: 0792343093
Pagini: 356
Ilustrații: XIII, 335 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.73 kg
Ediția:1997
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

1 Introduction.- 2 CPM Scheduling.- 3 CPM Least Cost Scheduling.- 4 Precedence Diagramming.- 5 Advanced Precedence Diagramming.- 6 Precedence Diagramming With Bounded Activity Duration.- 7 PDM Least Cost Scheduling.- 8 Resources In Scheduling.- 9 Art of Scheduling.- Appendix A Mathematical Basis.- 1. Digraph.- 2. Duality Theorem of Path and Cut.- 3. Minimal Path — Maximal Potential Problem.- 4. Maximal Flow Minimal Cut.- 5. The First “K” Longest Path.- 6. Linear Programming and Duality.- 7. Practical Problems and Solutions.- Problems.- Solutions.- 8. Historical Review.- Appendix B Computer Applications.- 1. Choosing Among Available Applications.- 2. ProjectDirector.

Recenzii

`This is a rare book. ... I would recommend the book to anybody who wants to understand the mathematical theory behind networks ...'
Journal of the Operational Research Society, 50:5 (1999)