✦ LIBER ✦

Genetic algorithm approach for precedence-constrained sequencing problems

✍ Scribed by YoungSu Yun; Chiung Moon

Book ID: 106387857
Publisher: Springer US
Year: 2009
Tongue: English
Weight: 912 KB
Volume: 22
Category: Article
ISSN: 0956-5515
DOI: 10.1007/s10845-009-0296-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic and Exact Algorithms for the P

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

✍ N. Samphaiboon; Y. Yamada 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

Hybrid genetic algorithms for constraine

Hybrid genetic algorithms for constrained placement problems

✍ Schnecke, V.; Vornberger, O. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 273 KB

An exact algorithm for the precedence-co

An exact algorithm for the precedence-constrained single-machine scheduling problem

✍ Tanaka, Shunji; Sato, Shun 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 754 KB

An algorithm for minimizing setups in pr

An algorithm for minimizing setups in precedence constrained scheduling

✍ George Steiner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 857 KB

A pegging approach to the precedence-con

A pegging approach to the precedence-constrained knapsack problem

✍ Byungjun You; Takeo Yamada 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 204 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