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
β¦ LIBER β¦
An exact algorithm for single-machine scheduling without
β Scribed by Shunji Tanaka; Shuji Fujikuma; Mituhiko Araki
- Publisher
- Springer US
- Year
- 2008
- Tongue
- English
- Weight
- 552 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A modified genetic algorithm for single
β
Jiyin Liu; Lixin Tang
π
Article
π
1999
π
Elsevier Science
π
English
β 301 KB
Exact and approximate algorithms for hig
β
Carlo Filippi; Giorgio Romanin-Jacur
π
Article
π
2009
π
Springer US
π
English
β 481 KB
An exact algorithm for multiple depot bu
β
M.A. Forbes; J.N. Holt; A.M. Watts
π
Article
π
1994
π
Elsevier Science
π
English
β 660 KB
An exact algorithm for scheduling identi
β
Dino Ahr; JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Marcus Oswald; Gerhard Reinelt
π
Article
π
2004
π
Springer
π
English
β 277 KB
Exact algorithms for scheduling multiple
β
Zhi-Long Chen; Warren B. Powell
π
Article
π
2003
π
John Wiley and Sons
π
English
β 140 KB
## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o
An intensive search evolutionary algorit
β
R. Maheswaran; S.G. Ponnambalam
π
Article
π
2004
π
Springer
π
English
β 434 KB