UTHM Institutional Repository

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 Combinatorial Optimization Problems and Informatics, 3 (3). pp. 81-93. ISSN 20071558

Full text not available from this repository.

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 > TS Manufactures > TS155-194 Production management. Operations management
Divisions: Faculty of Mechanical and Manufacturing Engineering > Department of Manufacturing and Industrial Engineering
Depositing User: Mr. Mohammad Shaifulrip Ithnin
Date Deposited: 12 Mar 2018 07:41
Last Modified: 12 Mar 2018 07:41
URI: http://eprints.uthm.edu.my/id/eprint/9712
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item