Publication:
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem

Simple item page
dc.contributor.authorKelvin, Lim Ching Wei
dc.date.accessioned2024-10-14T01:30:34Z
dc.date.available2024-10-14T01:30:34Z
dc.date.issued2023-03
dc.description.abstractFlexible job shop scheduling problem (FJSP) is a common optimisation problem in the industry. The use of parallel machines allows an operation to be executed on a machine assigned from a set of alternative machines, raising a combination of machine assignment and job sequencing sub-problems. A straightforward technique to solve the FJSP is to apply a pair of machine assignment rule (MAR) and job sequencing rule (JSR), i.e. a MAR-JSR pair. However, the performance of each MAR-JSR pair is problem-dependent. In addition, within an algorithm execution, the MAR-JSR pair performs differently at different problem states. Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. Positive outcomes on the application of simulated annealing-based hyper-heuristic (SA-HH) in addressing similar scheduling problem has been reported in the literature. Hence, this research proposes the SA-HH to produce a heuristic scheme (HS) made up of MAR-JSR pairs to solve the FJSP. The proposed SA-HH also incorporates a set of problem state features to facilitate the application of MAR-JSR pairs in the HS according to the state of the FJSP. This research investigates two variants of SA-HH, i.e. SA-HH based on the HS with problem state features (SA-HHPSF) and without problem state features (SA-HHNO-PSF).
dc.identifier.urihttps://erepo.usm.my/handle/123456789/20723
dc.language.isoen
dc.subjectFlexible Job Shop Scheduling Problem
dc.titleA Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
dc.typeResource Types::text::thesis::master thesis
dspace.entity.typePublication
oairecerif.author.affiliationUniversiti Sains Malaysia
Files
Collections
Pusat Pengajian Sains Komputer - Tesis