Single-machine two-agent scheduling to minimize the total tardiness with release time

• Main Authors: Mei-Chia Hu, 胡美佳
• Other Authors: Wen-Chiung Lee
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/55551843833370687059

碩士 === 逢甲大學 === 統計與精算所 === 100 === The needs of customers are different under limited labor power, resourses and cost control. It will be more effective if we plan ahead. In recent years, the scheduling problems with two competing agents have become more popular. In this paper, we studied a single-machine scheduling problem with release time where the objective is to minimize the total tardiness of jobs from the first agent given that the maximum tardiness of jobs from the second agent does not exceed an upper bound. A branch-and-bound algorithm is developed to search for the optimal solution. In addition, genetic algorithm are proposed to obtain the near-optimal solutions. Computational experiments are conducted to evaluate the performance of the proposed branch-and-bound algorithm and the genetic algorithms. Statistical tests are also performed to study the impact of the parameters.