Escalonamento com restrição de mão-de-obra : heuristicas combinatorias e limitantes inferiores
AUTOR(ES)
Cristina Celia Barros Cavalcante
DATA DE PUBLICAÇÃO
1998
RESUMO
This dissertation studies the scheduling problem under labour constraints (SPLC) and presents some strategies to obtain lower and upper bounds for this NP-hard problem. Concerning the lower bounds, two integer programming formulations are presented and the lower bounds associated with their linear relaxations are discussed. A branch-and-bound algorithm is also implemented as an essay to provide exact solutions for this problem. Finally, integer programming is used as a basis to extend a procedure reported in the literature to compute lower bounds for the resourte constrained project scheduling problem. In order to get upper bounds for SPLC, four heuristic approaches (priority rule based heuristic, schedule set based heuristic, linear programming based heuristic and sequential tabu search algorithm) and two parallel strategies (A - Team and parallel tabu search algorithm) are proposed and implemented. A benchmark instance data set for SPLC is generated to be used in the evaluation of the lower and upper bounds obtained in this dissertation and in other works available in the SPLC literature. Although little success has been achieved with respect to the lower bounds, in the case of upper bounds, the parallel strategies proposed in this work have shown the applicability of such techniques in providing high quality solutions for SPLC, and are, presently, responsible for the best known solutions for this problem
ASSUNTO(S)
programação heuristica programação inteira otimização combinatoria
