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

GA based heuristic for the open job shop scheduling problem

โœ Scribed by P. Senthilkumar; P. Shahabudeen

Publisher
Springer
Year
2006
Tongue
English
Weight
102 KB
Volume
30
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A batch splitting heuristic for dynamic
A batch splitting heuristic for dynamic job shop scheduling problem
โœ Hanil Jeong; Sangbok Woo; Sukho Kang; Jinwoo Park ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

The job shop scheduling problem has been a major target for many researchers. Unfortunately, though, most of the past studies assumed that a job consists of only a single part. If we assume that a job consists of a batch as in many real manufacturing environment, then we can obtain an improved sched

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