CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

James E. Falk; joel L. Horowitz

doi:10.1287/mnsc.19.4.446

CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

James E. Falk^*, joel L. Horowitz

^*Corresponding author for this work

Economics

Research output: Contribution to journal › Article › peer-review

95 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 language	English (US)
Pages (from-to)	446-455
Number of pages	10
Journal	Management Science
Volume	19
Issue number	4 Part 1
DOIs	https://doi.org/10.1287/mnsc.19.4.446
State	Published - 1972

ASJC Scopus subject areas

Strategy and Management
Management Science and Operations Research

Access to Document

10.1287/mnsc.19.4.446

Cite this

@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",

doi = "10.1287/mnsc.19.4.446",

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",

}

TY - JOUR

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

AU - Falk, James E.

AU - Horowitz, joel L.

PY - 1972

Y1 - 1972

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

U2 - 10.1287/mnsc.19.4.446

DO - 10.1287/mnsc.19.4.446

M3 - Article

AN - SCOPUS:0015484051

SN - 0025-1909

VL - 19

SP - 446

EP - 455

JO - Management Science

JF - Management Science

IS - 4 Part 1

ER -

CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this