✦ LIBER ✦

A network flow algorithm for just-in-time project scheduling

✍ Scribed by E.V. Levner; A.S. Nemirovsky

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 531 KB
Volume: 79
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90348-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for sche

A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems

✍ J. Miltenburg; G. Steiner; S. Yeomans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to b

A hybrid GA-SA algorithm for just-in-tim

A hybrid GA-SA algorithm for just-in-time scheduling of multi-level assemblies

✍ Anthony Roach; Rakesh Nagi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

A schedulability algorithm for data flow

A schedulability algorithm for data flow, hard-real-time distributed programs

✍ R Davoli; L.A Giachini 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 488 KB

Heuristic algorithms for task assignment

Heuristic algorithms for task assignment and scheduling in a processor network

✍ Shen Shen Wu; David Sweeting 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 677 KB

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

An efficient metaheuristic for integrate

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

✍ Rainer Kolisch; Christian Heimerl 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB