✦ LIBER ✦

The processor minimization problem with independent waiting-time constraints

✍ Scribed by E.G. Coffman Jr.; Leopold Flatto; Bjorn Poonen; Paul E. Wright

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 743 KB
Volume: 125
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90291-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing mean flow-time with parallel

Minimizing mean flow-time with parallel processors and resource constraints

✍ Błażewicz, J. ;Kubiak, W. ;Röck, H. ;Szwarcfiter, J. 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

A two-machine flowshop sequencing proble

A two-machine flowshop sequencing problem with limited waiting time constraints

✍ Dar-Li Yang; Maw-Sheng Chern 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 454 KB

The recognition problem with time constr

The recognition problem with time constraints

✍ P.P. Kol'tsov 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 950 KB

Heuristics for the minimum project-durat

Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints

✍ K. Neumann; J. Zhan 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 814 KB

The authors consider the problem of minimizing the duration of a project under fixed resource constraints. For the case that there are only minimal time lags between the start of successive activities and that therefore the project can be described by an acyclic network, a large number of exact and

Minimizing the fleet size with dependent

Minimizing the fleet size with dependent time-window and single-track constraints

✍ Lei Lei; Ronald Armstrong; Shanhong Gu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Using the Miller-Tucker-Zemlin constrain

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints

✍ Luis Gouveia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB