Parallel Machines Scheduling with Multiple Mold Constraints Based on Genetic Algorithms
碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 102 === Finding optimal solutions of scheduling problems has generally been NP-hard. Recently, GA-based algorithms have been introduced to find nearly optimal solutions, and many of them have found acceptable results in both efficiency and quality. In this study, we d...
Main Authors: | Ching-fu Chi, 漆慶福 |
---|---|
Other Authors: | Tzung-Pei Hong |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/37890951136679651334 |
Similar Items
-
Several heuristic algorithms for the scheduling problem of unrelated parallel machines with mold constraints
by: 李欣黛
Published: (2008) -
Solving Scheduling Problems of Identical Machines with Mold Constraints Based on Genetic Algorithms
by: Sheng-Shin-Jou, et al.
Published: (2009) -
Parallel Machine Scheduling with Resource Constraints
by: Hong, Huai-Che, et al.
Published: (2019) -
Design of Efficient Heuristic Algorithms for Solving Scheduling Problems with Multiple Mold Constraints
by: Ting-I Chien, et al.
Published: (2010) -
A Genetic Algorithm for Unrelated Parallel-Machine Scheduling Problems
by: Chun-Ching Lin, et al.
Published: (2001)