Title :
Parallel machine scheduling problems using memetic algorithms
Author :
Cheng, Runwei ; Gen, Mitsuo
Author_Institution :
Dept. of Ind. & Syst. Eng., Ashikaga Inst. of Technol., Japan
Abstract :
In this paper, we address parallel machine scheduling problems with an objective of minimizing the maximum weighted absolute lateness. Memetic algorithms are applied to solve this problem. The proposed method is compared with genetic algorithms and heuristics on randomly generated test problems. The results show that the memetic algorithm outperforms the others
Keywords :
minimisation; parallel algorithms; scheduling; maximum weighted absolute lateness; memetic algorithms; parallel machine scheduling problems; randomly generated test problems; Genetic algorithms; Job shop scheduling; Minimax techniques; Optimal scheduling; Parallel machines; Partitioning algorithms; Scheduling algorithm; Search methods; Single machine scheduling; Testing;
Conference_Titel :
Systems, Man, and Cybernetics, 1996., IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-3280-6
DOI :
10.1109/ICSMC.1996.561355
