CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

James E. Falk*, joel L. Horowitz

*Corresponding author for this work

Research output: Contribution to journalArticle

79 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)446-455
Number of pages10
JournalManagement Science
Volume19
Issue number4 Part 1
StatePublished - Jan 1 1972

    Fingerprint

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research

Cite this