Critical Path Problems with Concave Cost-Time Curves

1 December 1972

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 19 (4-part-1) , 446-455
https://doi.org/10.1287/mnsc.19.4.446

Abstract

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.

Keywords

PATH
CONCAVE
SEGMENTS
SCHEDULE
PIECEWISE
MINIMUM
COST TIME CURVES

This publication has 0 references indexed in Scilit: