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: | |
|---|---|
| Format: | Thesis |
| Language: | en |
| Published: |
2023
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/61274/1/24%20Pages%20from%20KELVIN%20LIM%20CHING%20WEI.pdf http://eprints.usm.my/61274/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|