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
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍