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:
主要作者: | |
---|---|
格式: | Thesis |
语言: | English |
出版: |
2023
|
主题: | |
在线阅读: | http://eprints.usm.my/61274/1/24%20Pages%20from%20KELVIN%20LIM%20CHING%20WEI.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|