CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

James E. Falk, joel L. Horowitz

Research output: Contribution to journalArticle

78 Citations (Scopus)

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

Critical path
Time costs
Schedule
Costs

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research

Cite this

Falk, James E. ; Horowitz, joel L. / CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES. In: Management Science. 1972 ; Vol. 19, No. 4 Part 1. pp. 446-455.
@article{fa2d37b6c09f4195993c840a65cb5639,
title = "CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.",
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.",
author = "Falk, {James E.} and Horowitz, {joel L.}",
year = "1972",
month = "1",
day = "1",
language = "English (US)",
volume = "19",
pages = "446--455",
journal = "Management Science",
issn = "0025-1909",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "4 Part 1",

}

CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES. / Falk, James E.; Horowitz, joel L.

In: Management Science, Vol. 19, No. 4 Part 1, 01.01.1972, p. 446-455.

Research output: Contribution to journalArticle

TY - JOUR

T1 - CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

AU - Falk, James E.

AU - Horowitz, joel L.

PY - 1972/1/1

Y1 - 1972/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0015484051&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015484051&partnerID=8YFLogxK

M3 - Article

VL - 19

SP - 446

EP - 455

JO - Management Science

JF - Management Science

SN - 0025-1909

IS - 4 Part 1

ER -