Multi-Objective Flexible Job Shop Scheduling Problem Based on Monte-Carlo Tree Search
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 102 === Flexible job-shop scheduling problem (FJSP) is very important in both fields of production management and combinatorial optimization. This thesis addresses the multi-objective flexible job shop scheduling problem (MO-FJSP) with three objectives which minimizi...
Main Authors: | Wu, Tung-Ying, 吳東穎 |
---|---|
Other Authors: | Wu, I-Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/29982195339271468796 |
Similar Items
-
Solving Flexible Job Shop Scheduling with Multi Objective Approach
by: Arash Motaghedi-larijani, et al.
Published: (2010-12-01) -
PARALLEL MACHINE SCHEDULING WITH MONTE CARLO TREE SEARCH
by: Anita Agárdi, et al.
Published: (2021-04-01) -
An Adaptive Multi-Objective Evolutionary Algorithm with Two-Stage Local Search for Flexible Job-Shop Scheduling
by: Yingli Li, et al.
Published: (2020-11-01) -
Optimizing Multi-Objective Flexible Job Shop Scheduling Problems with Greedy Randomized Adaptive Search Procedure
by: Ming-Chen Wei, et al. -
Evolutionary Algorithms for Multi-Objective Flexible Job Shop Scheduling Problems
by: Wen-Chou Huang, et al.
Published: (2010)