✦ LIBER ✦

Bottleneck identification procedures for the job shop scheduling problem with applications to genetic algorithms

✍ Scribed by Rui Zhang; Cheng Wu

Publisher: Springer
Year: 2008
Tongue: English
Weight: 385 KB
Volume: 42
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-008-1664-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved genetic algorithm for the job-s

Improved genetic algorithm for the job-shop scheduling problem

✍ Tung-Kuan Liu; Jinn-Tsong Tsai; Jyh-Horng Chou 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 405 KB

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

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

An effective hybrid genetic algorithm fo

An effective hybrid genetic algorithm for the job shop scheduling problem

✍ Chaoyong Zhang; Yunqing Rao; Peigen Li 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 398 KB

The Application of Parallel Multipopulat

The Application of Parallel Multipopulation Genetic Algorithms to Dynamic Job-Shop Scheduling

✍ J. G. Qi; G. R. Burns; D. K. Harrison 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 193 KB

Research on immune genetic algorithm for

Research on immune genetic algorithm for solving the job-shop scheduling problem

✍ Xiao-dong Xu; Cong-xin Li 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 165 KB