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...

Full description

Saved in:
Bibliographic Details
Main Author: Abdelraheem Elhaj, Hazir Farouk
Format: Thesis
Language:English
Published: 2005
Subjects:
Online Access:http://eprints.utm.my/id/eprint/9500/1/HazirFaroukAbdelraheemMFKM2005.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!