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:	TJ Mechanical engineering and machinery
Online Access:	http://eprints.utm.my/id/eprint/9500/1/HazirFaroukAbdelraheemMFKM2005.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.9500
record_format	uketd_dc
spelling	my-utm-ep.95002018-09-19T05:07:19Z Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem 2005-12 Abdelraheem Elhaj, Hazir Farouk TJ Mechanical engineering and machinery 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, researchers concentrated on developing branch-and-bound or heuristic algorithms. Ali Allahverdi, 1998 obtained the optimal solutions for minimizing mean flow time in a two-machine flow shop with Sequence-independent set up times by using three heuristic algorithms. In this project we addressed the same problem of Ali Allahverdi, based in his model a simulation model was built and validated using Witness software. Experiments were conducted for different number of jobs and different dispatching rules for jobs sequence. The setup-time also varied along the experiments. The effectiveness of the rules used was also measured by two other performance measures beside the mean flow time; they are WIP and machine utilization. The results were analysed and discussed and it concluded that all the performance measures were affected by number of jobs and change of set-up time for all rules used. It found that SPT rule generally performs best in terms of minimizing flow time, minimizing average number of jobs in the system and maximize machine utilization. 2005-12 Thesis http://eprints.utm.my/id/eprint/9500/ http://eprints.utm.my/id/eprint/9500/1/HazirFaroukAbdelraheemMFKM2005.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:1107 masters Universiti Teknologi Malaysia, Faculty of Mechanical Engineering Faculty of Mechanical Engineering
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	TJ Mechanical engineering and machinery
spellingShingle	TJ Mechanical engineering and machinery Abdelraheem Elhaj, Hazir Farouk Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
description	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, researchers concentrated on developing branch-and-bound or heuristic algorithms. Ali Allahverdi, 1998 obtained the optimal solutions for minimizing mean flow time in a two-machine flow shop with Sequence-independent set up times by using three heuristic algorithms. In this project we addressed the same problem of Ali Allahverdi, based in his model a simulation model was built and validated using Witness software. Experiments were conducted for different number of jobs and different dispatching rules for jobs sequence. The setup-time also varied along the experiments. The effectiveness of the rules used was also measured by two other performance measures beside the mean flow time; they are WIP and machine utilization. The results were analysed and discussed and it concluded that all the performance measures were affected by number of jobs and change of set-up time for all rules used. It found that SPT rule generally performs best in terms of minimizing flow time, minimizing average number of jobs in the system and maximize machine utilization.
format	Thesis
qualification_level	Master's degree
author	Abdelraheem Elhaj, Hazir Farouk
author_facet	Abdelraheem Elhaj, Hazir Farouk
author_sort	Abdelraheem Elhaj, Hazir Farouk
title	Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
title_short	Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
title_full	Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
title_fullStr	Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
title_full_unstemmed	Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
title_sort	effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
granting_institution	Universiti Teknologi Malaysia, Faculty of Mechanical Engineering
granting_department	Faculty of Mechanical Engineering
publishDate	2005
url	http://eprints.utm.my/id/eprint/9500/1/HazirFaroukAbdelraheemMFKM2005.pdf
_version_	1747814740887863296

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

Similar Items