An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

Article Abstract:

A branch and bound method is shown for scheduling project tasks subject to precedence and resource constraints, where tasks can be preempted at any discrete time instant and where the goal is to minimize the project duration. A depth-first solution approach is used in which the nodes in the solution tree represent resource and precedence feasible partial schedules. Branches coming from a parent node correspond to exhaustive and minimal combinations of activities, the delay of which resolves resource conflicts at each parent node. A precedence based lower bound and various dominance rules are used to limit the growth of the solutions tree.

Models, Usage

---

Project network models with discounted cash flows a guided tour through recent developments

Article Abstract:

Research on deterministic and stochastic project network models with discounted cash flows led to the development of optimal procedures for the unconstrained project scheduling problem. Formulations that have been developed for project scheduling problems exhibited different types of objective function and constraints. Furthermore, the orthodox theory capital budgeting advocates the net present value rule for making accept/reject decisions on investment projects.

Operations Research, Cash management

---

Optimal procedures for the discrete time/cost trade-off problem in project networks

Article Abstract:

Two optimal procedures for solving the discrete time/cost trade-off problem (DTCTP) in deterministic activity-on-arc networks under limited resource availability. Both based on dynamic programming, the first algorithm computes the minimal number of node reductions for converting a general network into a series-parallel network. The second employs a branch and bound search to minimize the alternative possibilities in arriving at a solution.

Operations research, Management science, Network analysis (Planning), Cases, Dynamic programming, Critical path analysis

Similar abstracts:

• Abstracts: PSPLIB - a project scheduling problem library. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Abstracts: Tabu search for the multilevel generalized assignment problem. Logic cuts for multilevel generalized assignment problems
• Abstracts: Heuristic approaches for n/m/F/sigma Ci scheduling problems. Heuristic procedure for minimizing makespan and the number of required pallets
• Abstracts: A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. Establishing the optimality of sequencing heuristics for cutting stock problems
• Abstracts: In Japan, everything old is new again; Hashimoto's promise of reform may vanish in a cabinet of cliques

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.