๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A network flow procedure for project crashing with penalty nodes

โœ Scribed by Arun Kanda; U.R.K. Rao

Book ID
103793129
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
523 KB
Volume
16
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A metaheuristic scheduling procedure for
A metaheuristic scheduling procedure for resource-constrained projects with cash flows
โœ Dan Zhu; Rema Padman ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 244 KB ๐Ÿ‘ 2 views

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under d

Unreliability evaluation for a limited-f
Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint
โœ Yi-Kuel Lin ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 431 KB

This paper concentrates on a limited-flow network in which each node and branch has a designated capacity, which will have different lower levels due to various partial and complete failures. VCe try to evaluate the system unreliability that the maximum flow of the network is less than or equal to t