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

A modified genetic algorithm for distributed scheduling problems

โœ Scribed by H. Z. Jia; A. Y. C. Nee; J. Y. H. Fuh; Y. F. Zhang

Book ID
111543839
Publisher
Springer US
Year
2003
Tongue
English
Weight
546 KB
Volume
14
Category
Article
ISSN
0956-5515

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A modified genetic algorithm for single
A modified genetic algorithm for single machine scheduling
โœ Jiyin Liu; Lixin Tang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB

In this paper we propose a modified genetic algorithm for the single machine scheduling problem with ready times. This algorithm improves the simple genetic algorithm by introducing two new steps: (1) a filtering step to filter out the worst solutions in each generation and fill in their positions w

A genetic algorithm methodology for comp
A genetic algorithm methodology for complex scheduling problems
โœ Bryan A. Norman; James C. Bean ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 79 KB ๐Ÿ‘ 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty