Heuristic and iterative greedy algorithms for the total weighted completion time multi-facility order scheduling with release times
碩士 === 逢甲大學 === 統計學系統計與精算碩士班 === 105 === The customer order scheduling problem has received growing attention in the research community. However, as research regarding customer order scheduling problems with ready times is relatively limited, this paper studies a multi-facility order scheduling prob...
Main Authors: | Tzu-Hsuan Yang, 楊子萱 |
---|---|
Other Authors: | 吳進家 |
Format: | Others |
Language: | zh-TW |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/mn56d5 |
Similar Items
-
An Iterated Greedy Heuristic Approach for Wafer Probing Scheduling Problems
by: Hsien_Lung Chen, et al.
Published: (2009) -
Solving Parallel Machine Scheduling Problems by an Iterated Greedy Heuristic
by: Yung-Sheng Liu, et al.
Published: (2009) -
An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence
Dependent Setup Times to Minimize Total Weighted Completion Time
by: Bahman Naderi, et al.
Published: (2010-02-01) -
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
by: Shih-Wei Lin, et al.
Published: (2014-01-01) -
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
by: Danial Khorasanian, et al.
Published: (2012-11-01)