Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem

The two-machine flow shop problem was shown to be NP-hard when the objective is to minimize total (mean) completion time instead of makespan even for the case where setup times are neglected. This means that it is highly unlikely to find a polynomial algorithm to solve the problem. Therefore, resear...

全面介紹

Saved in:
書目詳細資料
主要作者: Abdelraheem Elhaj, Hazir Farouk
格式: Thesis
語言:English
出版: 2005
主題:
在線閱讀:http://eprints.utm.my/id/eprint/9500/1/HazirFaroukAbdelraheemMFKM2005.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!