𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On single-walk parallelization of the job shop problem solving algorithms

✍ Scribed by Wojciech Bożejko

Book ID
113553802
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
333 KB
Volume
39
Category
Article
ISSN
0305-0548

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