Article ID: | iaor200935044 |
Country: | Poland |
Volume: | 1 |
Issue: | 1/2 |
Start Page Number: | 59 |
End Page Number: | 89 |
Publication Date: | Jan 2007 |
Journal: | Decision Making in Manufacturing and Services |
Authors: | Janiak Adam, Lichtenstein Maciej |
Keywords: | allocation: resources, computational analysis |
The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models, in which the job processing time or the job release date is given as a linear or convex function dependent on the quantity of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely the scheduling problems that appear in real life. Thus, in this paper, the authors present the computational complexity results and solution algorithms that have been developed for this kind of problems.