✦ LIBER ✦

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

✍ Scribed by Tanaka, Shunji; Sato, Shun

Book ID: 122670517
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 754 KB
Volume: 229
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.02.048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for single-machine sc

An exact algorithm for single-machine scheduling without

✍ Shunji Tanaka; Shuji Fujikuma; Mituhiko Araki 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 552 KB

Exact algorithms for inventory constrain

Exact algorithms for inventory constrained scheduling on a single machine

✍ Dirk Briskorn, Florian Jaehn, Erwin Pesch 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 452 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

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 polynomial time algorithm for a chance

A polynomial time algorithm for a chance-constrained single machine scheduling problem

✍ Naoki Katoh; Toshihide Ibaraki 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 280 KB

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