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

Enhancement of performance of Genetic Algorithm for job shop scheduling problems through inversion operator

โœ Scribed by K. S. Amirthagadeswaran; V. P. Arunachalam

Publisher
Springer
Year
2006
Tongue
English
Weight
149 KB
Volume
32
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A tutorial survey of job-shop scheduling
A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies
โœ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the past decade, two important issues have been extensively studied. One is how to encode a solution into a chromosome so as to ensure that a chromosome will correspond to a feasible solution. Th

A tutorial survey of job-shop scheduling
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies
โœ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the last three decades, this problem has captured the interest of a signiยฎcant number of researchers. A lot of literature has been published, but no ecient solution algorithm has been found yet f