UNIGE document Scientific Article
previous document  unige:26166  next document
add to browser collection

Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints

Meuwly, François-Xavier
Ries, Bernard
Published in Algorithmic Operations Research. 2010, vol. 5, p. 75-85
Abstract 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.
Keywords Project SchedulingLocal SearchMixed Graph Coloring
Full text
Article (Published version) (152 Kb) - document accessible for UNIGE members only Limited access to UNIGE
(ISO format)
MEUWLY, François-Xavier, RIES, Bernard, ZUFFEREY, Nicolas. Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. In: Algorithmic Operations Research, 2010, vol. 5, p. 75-85. https://archive-ouverte.unige.ch/unige:26166

142 hits

0 download


Deposited on : 2013-02-04

Export document
Format :
Citation style :