Archive-Based Optimization Heuristics for Fuzzy Multi-Objective Unrelated Parallel Machine Scheduling Problems
碩士 === 元智大學 === 工業工程與管理學系 === 97 === This research studies unrelated parallel machine scheduling problems (UPMSP) with two objectives – minimizing average tardiness and the number of tardy jobs. To make the study better fit a real world application, job processing times are defined as triangular f...
Main Authors: | Ai-Lian Jhong, 鍾愛蓮 |
---|---|
Other Authors: | Chiuh-Cheng Chyu |
Format: | Others |
Language: | zh-TW |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/44057636397991246854 |
Similar Items
-
THE ABURAS HEURISTIC: A MODIFIED HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINE PROBLEMS
by: H.M. Aburas
Published: (2012-01-01) -
Optimizing Multi-Objective Scheduling Problems of Unrelated Parallel Machines via Archived Metaheuristics with Matching Techniques
by: Wei-Shung Chang, et al.
Published: (2011) -
Several heuristic algorithms for the scheduling problem of unrelated parallel machines with mold constraints
by: 李欣黛
Published: (2008) -
Applying Simulated Annealing with Matching Improvement to Solve Fuzzy Multi-Objective Unrelated Parallel Machine Scheduling Problems
by: Ruei-Chi Li, et al.
Published: (2010) -
Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
by: Ebrahim Asadi Gangraj
Published: (2017-03-01)