| Article ID: | iaor20071733 |
| Country: | United Kingdom |
| Volume: | 33 |
| Issue: | 8 |
| Start Page Number: | 2099 |
| End Page Number: | 2112 |
| Publication Date: | Aug 2006 |
| Journal: | Computers and Operations Research |
| Authors: | Yang Dar-Li, Kuo Wen-Hung |
| Keywords: | learning |
In many realistic situations, the more time you practice, the better learning effect you obtain. Thus, we propose a time-dependent learning effect and introduce it into the single-machine group scheduling problems. The two objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide two polynomial time algorithms to solve these problems.