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

A generalized permutation approach to job shop scheduling with genetic algorithms

โœ Scribed by Christian Bierwirth

Publisher
Springer
Year
1995
Tongue
German
Weight
617 KB
Volume
17
Category
Article
ISSN
0171-6468

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