Mathematical Programming and Financial Objectives for Scheduling Projects
Autor Alf Kimmsen Limba Engleză Hardback – 30 iun 2001
The book is divided into six parts. The first part gives a brief introduction to project management. Part two examines scheduling projects in order to maximize their net present value. Part three considers capital rationing. Many decisions on selecting or rejecting a project cannot be made in isolation and multiple projects must be taken fully into account. Since the requests for capital resources depend on the schedules of the projects, scheduling taken on more complexity. Part four studies the resource usage of a project in greater detail. Part five discusses cases where the processing time of an activity is a decision to be made. Part six summarizes the main results that have been accomplished.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 368.05 lei 6-8 săpt. | |
| Springer Us – 23 oct 2012 | 368.05 lei 6-8 săpt. | |
| Hardback (1) | 375.85 lei 6-8 săpt. | |
| Springer – 30 iun 2001 | 375.85 lei 6-8 săpt. |
Preț: 375.85 lei
Nou
Puncte Express: 564
Preț estimativ în valută:
66.50€ • 77.47$ • 58.07£
66.50€ • 77.47$ • 58.07£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792373865
ISBN-10: 0792373863
Pagini: 204
Ilustrații: VIII, 187 p.
Dimensiuni: 160 x 241 x 16 mm
Greutate: 0.48 kg
Ediția:2001
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 0792373863
Pagini: 204
Ilustrații: VIII, 187 p.
Dimensiuni: 160 x 241 x 16 mm
Greutate: 0.48 kg
Ediția:2001
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1. Focus.- 2. Modeling Projects.- 3. Central Problem.- 4. Resource-Constrained Scheduling.- 5. Network Decomposition.- 6. Relaxation of Resource Constraints.- 7. Computational Studies.- 8. Capital Rationing.- 9. Budget Elimination.- 10. Computational Studies.- 11. Resource Leveling.- 12. Optimization Guided Scheduling I.- 13. Optimization Guided Scheduling II.- 14. Computational Studies.- 15. Crashing.- 16. Preprocessing.- 17. Network Decomposition.- 18. Computational Studies.- 19. Concluding Remarks.- 20. Future Work.