𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling arc maintenance jobs in a network to maximize total flow over time

✍ Scribed by Boland, Natashia; Kalinowski, Thomas; Waterer, Hamish; Zheng, Lanbo

Book ID
122806738
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
862 KB
Volume
163
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximal expected flow in a network subje
Maximal expected flow in a network subject to arc failures
✍ Y. P. Aneja; K. P. K. Nair πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 494 KB

## Abstract In a network subject to arc failures, each chain has a probability of failure. Therefore the maximal flow in the network is a random variable. The problem considered here is that of maximizing the expected flow. An arc‐chain formulation of the problem, and an algorithm for computing an

[Springer Optimization and Its Applicati
[Springer Optimization and Its Applications] Just-in-Time Systems Volume 60 || Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
✍ RΓ­os-Mercado, Roger Z.; RΓ­os-SolΓ­s, YasmΓ­n A. πŸ“‚ Article πŸ“… 2011 πŸ› Springer New York 🌐 English βš– 302 KB

Whether different types of costs are to be reduced, benefits to be maximized or scarce resourcesΒ to be managed, scheduling theory provides intelligent methods for practitioners and scientists. The just-in-time (JIT) production philosophy has enriched the classical scheduling theory with models that