Pedersen, C.R.3; Rasmussen, R.V.3; Andersen, Kim Allan5
1 Department of Business Studies, Aarhus School of Business, Aarhus BSS, Aarhus University2 CORAL - Centre for Operations Research Applications in Logistics, Aarhus School of Business, Aarhus BSS, Aarhus University3 unknown4 Department of Economics and Business Economics, Aarhus BSS, Aarhus University5 Department of Economics and Business Economics, Aarhus BSS, Aarhus University
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 -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads to a significant decrease in makespan compared to the strategy currently implemented.
Computers and Operations Research, 2007, Vol 34, Issue 7, p. 2025-2042