| Article ID: | iaor20118978 |
| Volume: | 218 |
| Issue: | 5 |
| Start Page Number: | 2069 |
| End Page Number: | 2073 |
| Publication Date: | Nov 2011 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Yang Dar-Li, Kuo Wen-Hung |
| Keywords: | learning, combinatorial optimization |
This paper studies a single machine scheduling problem simultaneously with deteriorating jobs and learning effects. The objectives are to minimize the makespan and the number of tardy jobs, respectively. Two polynomial time algorithms are proposed to solve these problems optimally.