Article ID: | iaor20082412 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 7 |
Start Page Number: | 2025 |
End Page Number: | 2042 |
Publication Date: | Jul 2007 |
Journal: | Computers and Operations Research |
Authors: | Rasmussen Rasmus V., Pedersen Christian Roed, Andersen Kim A. |
Keywords: | heuristics: tabu search |
This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general