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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems /
由: Ong, Chung Sin -
Approximation algorithms & heuristics for job shop scheduling /
由: Lin, Dan Dan
出版: (1998) -
An application of genetic algorithm to a job shop scheduling /
由: Kovoor, Punnose P.
出版: (1998) -
Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms /
由: Shoeeb, Salihin Farag
出版: (2003) -
Berth allocation planning using genetic algorithm /
由: Ying, You Mei
出版: (1995)