A network flow procedure for project crashing with penalty nodes (Q790038)

scientific article

In more languages

Language	Label	Description	Also known as
English	A network flow procedure for project crashing with penalty nodes	scientific article

Statements

A network flow procedure for project crashing with penalty nodes (English)

European Journal of Operational Research

1984

activity network

project scheduling

project-cost curve

primal dual considerations

0 references

optimality conditions

0 references

network flow interpretation

penalty nodes

auxiliary sources

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(84)90072-9

0 references

cites work

The Theory of Networks and Management Science. Part I

0 references

Critical Path Problems with Concave Cost-Time Curves

0 references

Q5514188

0 references

A Network Flow Computation for Project Cost Curves

0 references

Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”

0 references

Network flow, transportation and scheduling. Theory and algorithms

0 references

Critical-Path Planning and Scheduling: Mathematical Basis

0 references

A Simple CPM Time-Cost Tradeoff Algorithm

0 references

Identifiers

zbMATH Open document ID

0533.90045

0 references

DOI

10.1016/0377-2217(84)90072-9

0 references

Mathematics Subject Classification ID

Sitelinks

Mathematics(1 entry)

mardi Publication:790038