✦ LIBER ✦

An effective hybrid genetic algorithm for the job shop scheduling problem

✍ Scribed by Chaoyong Zhang; Yunqing Rao; Peigen Li

Publisher: Springer
Year: 2008
Tongue: English
Weight: 398 KB
Volume: 39
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-007-1354-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved genetic algorithm for the job-s

Improved genetic algorithm for the job-shop scheduling problem

✍ Tung-Kuan Liu; Jinn-Tsong Tsai; Jyh-Horng Chou 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 405 KB

Flexible job-shop scheduling problem by

Flexible job-shop scheduling problem by genetic algorithm

✍ Kenichi Ida; Kensaku Oka 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

A Modified Genetic Algorithm for Job Sho

A Modified Genetic Algorithm for Job Shop Scheduling

✍ L. Wang; D.-Z. Zheng 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 85 KB

Research on immune genetic algorithm for

Research on immune genetic algorithm for solving the job-shop scheduling problem

✍ Xiao-dong Xu; Cong-xin Li 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 165 KB

Hybrid Rollout Approaches for the Job Sh

Hybrid Rollout Approaches for the Job Shop Scheduling Problem

✍ F. Guerriero 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 417 KB

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