Scheduling with time dependent processing times: Review and extensions

Scheduling with time dependent processing times: Review and extensions

0.00 Avg rating0 Votes
Article ID: iaor20002081
Country: United Kingdom
Volume: 50
Issue: 7
Start Page Number: 711
End Page Number: 720
Publication Date: Jul 1999
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: production
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.