Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach

Bareduan, Salleh Ahmad and Hasan, Sulaiman (2012) Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach. International Journal of Combinational Optimization Problems & Informatics, 3 (3).

Text J4741_d0bca5a4021271c23fab3726ebba24d6.pdf Restricted to Registered users only Download (513kB) | Request a copy

Abstract

This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy of the makespan computation. Using these correction factors, a constructive heuristic was developed to solve for near-optimal scheduling sequence. For small size problems, the heuristic results were compared with the optimum makespan generated from complete enumeration. For medium and large size problems, the heuristic performance was measured by comparing its makespan with the solutions generated by the NEH and lowerbound. At weak and strong dominance level, the heuristic shows good performance against the lowerbound and better results compared to the NEH for large and medium size problems.

Item Type:	Article
Uncontrolled Keywords:	Scheduling, heuristic; re-entrant flow shop; bottleneck.
Subjects:	T Technology > T Technology (General)
Divisions:	Faculty of Mechanical and Manufacturing Engineering > Department of Materials Engineering and Design
Depositing User:	Mr. Abdul Rahim Mat Radzuan
Date Deposited:	06 Dec 2022 02:52
Last Modified:	06 Dec 2022 02:52
URI:	http://eprints.uthm.edu.my/id/eprint/8049

Actions (login required)

View Item