Heuristic algorithms for a complex parallel machine scheduling problem
✍ Scribed by Zoltán Blázsik; Csanád Imreh; Zoltán Kovács
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 145 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1435-246X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## a b s t r a c t We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. For this NP-hard problem we propose two exact algorithms: a sequenti
In this paper, we investigate how to apply the hybrid genetic algorithms (the memeti¢ algorithms) to solve the parallel machine scheduling problem. There are two essential issues to be dealt with for all kinds of parallel machine scheduling problems: job partition among machines and job sequence wit