Using Multiple Trajectory Search Algorithm to Solve the Open Shop Scheduling Problem
碩士 === 國立中興大學 === 資訊網路多媒體研究所 === 98 === The open shop scheduling problem is an NP-hard combinatorial optimization problem and has long attracted much attention. In this thesis, we propose a new metaheuristic called the multiple trajectory search to solve the open shop scheduling problem. Observing t...
Main Authors: | Bo-Fu Huang, 黃柏輔 |
---|---|
Other Authors: | Lin-Yu Tseng |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/17179126365769955728 |
Similar Items
-
Using Multiple Trajectory Search Algorithm to solve the Resource-Constrained Project Scheduling Problem
by: Kuan-Cheng Lin, et al.
Published: (2010) -
Using Multiple Trajectory Search Algorithm to Solve the Sequential Ordering Problem
by: Tai-Sian Huang, et al.
Published: (2010) -
A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems
by: Ko-Wei Huang, et al.
Published: (2019-03-01) -
Using Multiple Trajectory Search Algorithm to Solve the Quadratic Assignment Problem
by: Jhih-Sian Wu, et al.
Published: (2010) -
Solving Flow Shop Group Scheduling Problem by Tabu Search
by: Chia-Tang Wu, et al.