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

Genetic algorithms and job shop scheduling

โœ Scribed by John E. Biegel; James J. Davern


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
618 KB
Volume
19
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An agent-based parallel approach for the
โœ 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