## Mathematical Programming and Financial Objectives for Scheduling ProjectsMathematical Programming and Financial Objectives for Scheduling Projects focuses on decision problems where the performance is measured in terms of money. As the title suggests, special attention is paid to financial objectives and the relationship of financial objectives to project schedules and scheduling. In addition, how schedules relate to other decisions is treated in detail. The book demonstrates that scheduling must be combined with project selection and financing, and that scheduling helps to give an answer to the planning issue of the amount of resources required for a project. The author makes clear the relevance of scheduling to cutting budget costs. 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

FOCUS | 3 |

CENTRAL PROBLEM | 19 |

RESOURCECONSTRAINED SCHEDULING | 29 |

Copyright | |

14 other sections not shown

### Other editions - View all

Mathematical Programming and Financial Objectives for Scheduling Projects Alf Kimms Limited preview - 2012 |

Mathematical Programming and Financial Objectives for Scheduling Projects Alf Kimms No preview available - 2012 |

Mathematical Programming and Financial Objectives for Scheduling Projects Alf Kimms No preview available - 2001 |

### Common terms and phrases

activity-on-arc network activity-on-node network algorithm Average Gap Average Run-Time Benders BP LR BP LST BP capital budgeting cash flows ccv cvx hyb chain column generation procedure completion complexity index computational study consider cost function cvx hyb ccv deadline defined denote discount rate discrete time-cost tradeoff dynamic programming earliest start schedule feasible schedule feasible solution heuristic hyb ccv cvx instances Integer Programming iteration Journal of Operational Linear Programming lower bound LP-relaxation LRp LRs LRp LRs LRp LRs LST BP LST makespan maximizing minimum cut minimum time lag model formulation number of activities objective function value Operational Research optimum objective function optimum solution phase precedence constraints present value project scheduling resource constraints resource investment problem resource requests restricted master problem result scheduling problem selected projects solution procedure solve subnetwork subproblem t=ECj Table tabu search test-bed thru time-cost tradeoff problem upper bound xpjt zero