Scheduling with time dependent processing times: Review and extensions

In classical scheduling theory job processing times are constant. However, there are many situations where processing time of a job depends on the sta rting time of the job in the queue. This paper reviews the rapidly growing literature on single machine scheduling models with time dependent processi ng times. Attention is focused on linear, piecewise linear and non-linear p rocessing time functions for jobs. We survey known results and introduce ne w solvable cases. Finally, we identify the areas and give directions where further research is needed.