Article ID: | iaor20121859 |
Volume: | 219 |
Issue: | 1 |
Start Page Number: | 59 |
End Page Number: | 72 |
Publication Date: | May 2012 |
Journal: | European Journal of Operational Research |
Authors: | Valls Vicente, Lino Pilar, Quintanilla Sacramento, Prez ngeles |
Keywords: | combinatorial optimization, heuristics: genetic algorithms |
In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi‐mode resource‐constrained project scheduling problem with pre‐emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowing pre‐emption are also presented.