𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved analysis of an algorithm for the coupled task problem with UET jobs

✍ Scribed by József Békési; Gábor Galambos; Marcus Oswald; Gerhard Reinelt

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
953 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
✍ Leila Asadzadeh; Kamran Zamanifar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s