๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Memetic algorithms for solving job-shop scheduling problems

โœ Scribed by S. M. Kamrul Hasan; Ruhul Sarker; Daryl Essam; David Cornforth

Book ID
107647033
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
521 KB
Volume
1
Category
Article
ISSN
1865-9284

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