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

The Application of Parallel Multipopulation Genetic Algorithms to Dynamic Job-Shop Scheduling

โœ Scribed by J. G. Qi; G. R. Burns; D. K. Harrison

Publisher
Springer
Year
2000
Tongue
English
Weight
193 KB
Volume
16
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

Genetic algorithms for the job-shop sche
Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence
โœ Fatima Ghedjati ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an