Flexible job shop scheduling using priority heuristics and genetic algorithm

In this research, flexible job shop scheduling problem has been studied. The aim of this research is to minimize the maximum completion time (makespan). The job shop scheduling is very common in practice and uniform machines (parallel machines with different speeds) have been used in job shop enviro...

全面介紹

Saved in:
書目詳細資料
主要作者: Farashahi, Hamid Ghaani
格式: Thesis
語言:English
出版: 2010
主題:
在線閱讀:http://psasir.upm.edu.my/id/eprint/41178/1/FK%202010%2083%20IR.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍