A study of the single-machine scheduling problem with learning effect and ready times
碩士 === 逢甲大學 === 統計與精算所 === 98 === In many situations, a worker’s ability improves as a result of repeating the same or similar tasks; this phenomenon is known as the learning effect. This paper investigates a single-machine problem with the sum of processing times based learning effect and ready tim...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51761458999182460865 |
| Summary: | 碩士 === 逢甲大學 === 統計與精算所 === 98 === In many situations, a worker’s ability improves as a result of repeating the same or similar tasks; this phenomenon is known as the learning effect. This paper investigates a single-machine problem with the sum of processing times based learning effect and ready times where the objective is to minimize the makespan. We first develop a branch-and-bound algorithm incorporating with several dominance properties and lower bounds to derive the optimal solution. Then we also propose a heuristic algorithm for a near-optimal solution. Finally, we conduct a computational experiment to evaluate the performances of proposed algorithm. The results show that the branch-and-bound algorithm can solve instances up to 24 jobs, and the average error percentage of the proposed heuristic is less than 0.5%.
|
|---|