Please use this identifier to cite or link to this item:
Title: A Hybridized Approach for Solving Group Shop Problems (GSP)
Authors: TAN MU YEN
Keywords: Machine Scheduling, Shop Scheduling Problem, Group Shop Problem, Meta-Heuristics, Simulated Annealing, Tabu Search
Issue Date: 31-May-2006
Citation: TAN MU YEN (2006-05-31). A Hybridized Approach for Solving Group Shop Problems (GSP). ScholarBank@NUS Repository.
Abstract: In recognition of the industriesa?? need for single and robust algorithm for the various classes of shop scheduling problems, the thesis addresses the application of meta-heuristics approaches to tackle a generalized formulation of shop scheduling problem known as the Group Shop Problem (GSP) by developing a hybridized two-phase approach. The proposed algorithm incorporates features of simulated annealing and variable neighborhood search to diversify its search in the initial phase. Additionally, the algorithm adopts the use of tabu-lists from Tabu Search throughout to prevent cyclical search from arising and implements backtrack memory to limit the search to only promising regions of the search space. To evaluate its performance, the algorithm has been subjected to extensive computational experiments using a set of benchmark problems for comparison with other known approaches for solving GSP. The empirical results show that the proposed algorithm does produce solutions of comparable quality but with shorter processing time.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
TanMY.pdf750.39 kBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.