✦ LIBER ✦

Certain exact and approximate algorithms for solving precedence problems with constraints

✍ Scribed by A. E. Serik

Publisher: Springer US
Year: 1986
Tongue: English
Weight: 838 KB
Volume: 21
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01078824

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A monotone approximation algorithm for s

A monotone approximation algorithm for scheduling with precedence constraints

✍ Sven O. Krumke; Anne Schwahn; Rob van Stee; Stephan Westphal 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Approximation algorithms for UET schedul

Approximation algorithms for UET scheduling problems with exact delays

✍ Alexander A. Ageev; Alexei E. Baburin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 167 KB

An algorithm for solving global optimiza

An algorithm for solving global optimization problems with nonlinear constraints

✍ Yaroslav D. Sergeyev; Dmitri L. Markin 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 573 KB

Heuristics and exact algorithms for solv

Heuristics and exact algorithms for solving the Monden problem

✍ J. Bautista; R. Companys; A. Corominas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 869 KB

An algorithm for solving a convex progra

An algorithm for solving a convex programming problem with linear constraints

✍ B. N. Pshenichnyi; I. F. Ganzhela 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 384 KB

An approximation algorithm for the prece

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications

✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary