✦ LIBER ✦

A new polynomial algorithm for a parallel identical scheduling problem

✍ Scribed by Yumei Li; Hongxing Li; Vincent C. Yen

Book ID: 107504604
Publisher: South China University of Technology and Academy of Mathematics and Systems Science, CAS
Year: 2007
Tongue: English
Weight: 250 KB
Volume: 5
Category: Article
ISSN: 1672-6340
DOI: 10.1007/s11768-006-6044-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new ILS algorithm for parallel machine

A new ILS algorithm for parallel machine scheduling problems

✍ Lixin Tang; Jiaxiang Luo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 191 KB

Heuristic algorithms for a complex paral

Heuristic algorithms for a complex parallel machine scheduling problem

✍ Zoltán Blázsik; Csanád Imreh; Zoltán Kovács 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 145 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

A polynomial algorithm for a two-machine

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

✍ Svetlana A. Kravchenko 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 462 KB

An approximate algorithm for a high-mult

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

✍ Carlo Filippi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A parallel optimization algorithm for mi

A parallel optimization algorithm for minimum execution-time multiprocessor scheduling problem

✍ Hironori Kasahara; Atsusi Itoh; Hisamitsu Tanaka; Keisuke Itoh 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 944 KB

## Abstract This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution‐time multiprocessor scheduling problem which is a strong NP‐hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS am