This paper presents an algorithm for determining the minimum cost schedule of tasks in a critical path network in which task cost-time curves may be concave. A computer program for the case of cost-time curves that are piecewise linear in two segments is described, and a numerical example is presented.
|Original language||English (US)|
|Number of pages||10|
|Issue number||4 Part 1|
|State||Published - Jan 1 1972|
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research