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

An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover

โœ Scribed by Jinn-Tsong Tsai; Tung-Kuan Liu; Wen-Hsien Ho; Jyh-Horng Chou

Publisher
Springer
Year
2007
Tongue
English
Weight
189 KB
Volume
38
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
โœ Leila Asadzadeh; Kamran Zamanifar ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s

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