DocumentCode :
354056
Title :
A heuristic algorithm for minimizing the range of lateness and makespan on non-identical multiprocessors
Author :
Decai, Huang ; Yihua, Zhu ; Yangwei, Zhao ; Wanliang, Wang
Author_Institution :
Res. Center of Sci., Zhejiang Univ. of Technol., China
Volume :
3
fYear :
2000
fDate :
2000
Firstpage :
1985
Abstract :
A generalized multi-objective model is presented for minimizing the range of lateness and makespan on a multiprocessors job scheduling problem. It is proved that this job scheduling problem is an NP complete problem. So a heuristic algorithm is given to solve the scheduling problem. The numerical example illustrates that the heuristic algorithm is designed very well and can find very good approximate optimal solution
Keywords :
computational complexity; flexible manufacturing systems; hierarchical systems; mathematical programming; production control; NP complete problem; approximate optimal solution; generalized multi-objective model; heuristic algorithm; job scheduling problem; lateness; makespan; nonidentical multiprocessors; Algorithm design and analysis; Flexible manufacturing systems; Heuristic algorithms; Job shop scheduling; Manufacturing processes; Manufacturing systems; Processor scheduling; Production management; Research and development; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
Conference_Location :
Hefei
Print_ISBN :
0-7803-5995-X
Type :
conf
DOI :
10.1109/WCICA.2000.862895
Filename :
862895
Link To Document :
بازگشت