Article1961

A Network Flow Computation for Project Cost Curves

366 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

Resource-Constrained Project Scheduling Complexity and Algorithms in Graphs Optimization and Mathematical Programming

Abstract

A network flow method is outlined for solving the linear programming problem of computing the least cost curve for a project composed of many individual jobs, where it is assumed that certain jobs must be finished before others can be started. Each job has an associated crash completion time and normal completion time, and the cost of doing the job varies linearly between these extreme times. Given that the entire project must be completed in a prescribed time interval, it is desired to find job times that minimize the total project cost. The~method solves this problem for all feasible time intervals.

Citations in this library

Stored only when both papers are in the corpus — 366 citations exist upstream.

References

1961Critical-Path Planning and Scheduling: Mathematical Basis

Cited by

2010Pluralism in Project Management: Navigating the Crossroads of Specialization and Fragmentation 1996Project management with time, cost, and quality considerations 1995The discrete time-cost tradeoff problem revisited 1971A Simple CPM Time-Cost Tradeoff Algorithm 1973Project Scheduling under Resource Constraints—Historical Review and Categorization of Procedures 2003The construction of stable project baseline schedules 1993Project Scheduling Problems: A Survey 1996Optimal procedures for the discrete time/cost trade-off problem in project networks

Imported from OpenAlex (CC0) — nothing here is generated.