Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints
Zufferey, Nicolas; Ries, Bernard; Meuwly, François-Xavier (2010), Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints, Algorithmic Operations Research, 5, 5, p. 75-85
TypeArticle accepté pour publication ou publié
Lien vers un document non conservé dans cette basehttp://journals.hil.unb.ca/index.php/AOR/article/view/14273
Nom de la revueAlgorithmic Operations Research
MétadonnéesAfficher la notice complète
Résumé (EN)Consider a project which consists in a set of operations to be performed, assuming the processing time of each operation is at most one time period. In this project, precedence and incompatibility constraints between operations have to be satisfied. The goal is to assign a time period to each operation while minimizing the duration of the whole project and while taking into account all the constraints. Based on the mixed graph coloring model and on an efficient and quick tabu search algorithm for the usual graph coloring problem, we propose a tabu search algorithm as well as a variable neighborhood search heuristic for the considered scheduling problem. We formulate an integer linear program (useful for the CPLEX solver) as well as a greedy procedure for comparison considerations. Numerical results are reported on instances with up to 500 operations.
Mots-clésPrecedence Constraints; Incompatibility Constraints; Scheduling Problem
Affichage des éléments liés par titre et auteur.
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations Jeunet, Jully; Salassa, Fabio (2022) Article accepté pour publication ou publié