𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

✍ Scribed by Orhan Engin; Gülşad Ceran; Mustafa K. Yilmaz

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
219 KB
Volume
11
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
✍ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

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