𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the Job Shop Scheduling Problem Using the Imperialist Competitive Algorithm

✍ Scribed by Zhang, Jie; Zhang, Peng; Yang, Jian Xiong; Huang, Ying

Book ID
126318472
Publisher
Trans Tech Publications, Ltd.
Year
2012
Tongue
English
Weight
398 KB
Volume
430-432
Category
Article
ISSN
1662-8958

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