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 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Simulation of sequencing rules in a five-similar-machine job shop
由: Ang, Liqi
出版: (2010) -
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
由: Sh Ahmad, Sh Salleh
出版: (2009) -
Bottleneck-based heuristic for three-machine flow shop scheduling
由: Abdul Rahim, Mohd Salleh
出版: (2011) -
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
由: Chong, Zheng Ziao
出版: (2015) -
Reorganizing dispatching layout to minimize dispatching time at apparel industry
由: Nor Asmaa Alyaa, Nor Azlan
出版: (2014)