Heuristic and iterative greedy algorithms for the total weighted completion time multi-facility order scheduling with release times

• Main Authors: Tzu-Hsuan Yang, 楊子萱
• Other Authors: 吳進家
• Format: Others
• Language: zh-TW
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/mn56d5

碩士 === 逢甲大學 === 統計學系統計與精算碩士班 === 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 problem with ready times where the measure criterion is to minimize the total weighted completion time of all the given orders. To solve this intractable problem, we first derive several dominance rules and two lower bounds used in a branch-and-bound method to find an exact solution. We then modify five existing heuristics and adopt an iterative greedy (IG) algorithm to find a near-optimal solution. Specifically, we use a fixed proportion of destruction and a linear function of destruction in the IG algorithm. To get a good quality of solutions, all the proposed heuristics are improved by pairwise improvement, and we perform one-way analysis of variance and Fisher’s least significant difference tests to evaluate and compare the performances of all the proposed algorithms.