Single-machine scheduling to minimize the total completion time and tardiness with two competing agents
碩士 === 逢甲大學 === 統計與精算所 === 100 === Scheduling with two competing agents has become a popular research topic in recent years. Most of the research focuses on the objective functions with constraint forms, that is, to minimize the objective function of jobs from one agent given that the objective func...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20920977425406159548 |
| Summary: | 碩士 === 逢甲大學 === 統計與精算所 === 100 === Scheduling with two competing agents has become a popular research topic in recent years. Most of the research focuses on the objective functions with constraint forms, that is, to minimize the objective function of jobs from one agent given that the objective function of jobs from the other agent does not exceed an upper bound. In this paper, we consider a different approach for a two-agent problem on a single machine. The objective is the weighted sum of the total completion time of jobs from one agent and the total tardiness of jobs from the other agent. Two branch-and-bound algorithms are proposed to derive the optimal sequences. In addition, a simulated annealing and two genetic algorithms are provided to search for the near-optimal solutions. Computational experiments show that the proposed branch-and branch algorithm could solve problems of up to 40 jobs in a reasonable amount of time and the genetic algorithm that use initial sequence is good with an average error percentage of less then 1.5% for all the tested cases.
|
|---|