𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem

✍ Scribed by Frutos, Mariano; Tohmé, Fernando

Book ID
120493963
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
580 KB
Volume
13
Category
Article
ISSN
1109-2858

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

Clonal Selection Based Memetic Algorithm
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
✍ Jin-hui Yang; Liang Sun; Heow Pueh Lee; Yun Qian; Yan-chun Liang 📂 Article 📅 2008 🏛 SciencePress (China) 🌐 English ⚖ 591 KB

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hyp