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

Solving job shop scheduling problems using artificial immune system

โœ Scribed by M. Chandrasekaran; P. Asokan; S. Kumanan; T. Balamurugan; S. Nickolas

Publisher
Springer
Year
2006
Tongue
English
Weight
194 KB
Volume
31
Category
Article
ISSN
0268-3768

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