| Article ID: | iaor20001520 |
| Country: | Netherlands |
| Volume: | 115 |
| Issue: | 1 |
| Start Page Number: | 173 |
| End Page Number: | 178 |
| Publication Date: | May 1999 |
| Journal: | European Journal of Operational Research |
| Authors: | Biskup Dirk |
| Keywords: | learning |
The focus of this work is to analyze learning in single-machine scheduling problems. It is surprising that the well-known learning effect has never been considered in connection with scheduling problems. It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable.