A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
Flexible 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 strai...
Saved in:
Main Author: | Kelvin, Lim Ching Wei |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | http://eprints.usm.my/61274/1/24%20Pages%20from%20KELVIN%20LIM%20CHING%20WEI.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
by: Anwar, Khairul
Published: (2018) -
Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation
by: Choong, Shin Siang
Published: (2019) -
Personal Online Shopping Widget:
Consumer Acceptance Level Of Online
Shopping Widget
by: Lee, Yean Hooi
Published: (2009) -
Heuristic Based Planning Approach For
Improving Wireless Network Coverage Of Multi-Storey Building
by: Yeong, Shoa Yei
Published: (2011) -
Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
by: Kheoh, Hooi Leng
Published: (2013)