UNIGE document Chapitre d'actes
previous document  unige:73315  next document
add to browser collection
Title

Graph Coloring Tabu Search for Project Scheduling

Author
Published in Van Do, T. & Nguyen, N.-T. & Le Thi, H.-A. Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications: Advanced Computational Methods for Knowledge Engineering - ICCSAMA 2015. Metz (France) - 11-13 May 2015 - Piscataway: Springer. 2015, p. 107-118
Collection Advances in Intelligent Systems and Computing; 358
Abstract Consider a project consisting of a set of n operations to be performed. Some pairs {j,j′} of operations are incompatible, which can have two different meanings. On the one hand, it can be allowed to perform j and j′ at common time periods. In such a case, incompatibility costs are encountered and penalized in the objective function. On the other hand, it can be strictly forbidden to perform j and j′ concurrently. In such a case, the overall project duration has to be minimized. In this paper, three project scheduling problems (P 1), (P 2) and (P 3) are considered. It will be showed that tabu search relying on graph coloring models is a very competitive method for such problems. The overall approach is called graph coloring tabu search and denoted GCTS.
Keywords Graph coloringTabu searchProject schedulingCombinatorial optimizationMetaheuristics
Identifiers
ISBN: 978-3-319-17995-7
Full text
Structures
Citation
(ISO format)
ZUFFEREY, Nicolas. Graph Coloring Tabu Search for Project Scheduling. In: Van Do, T. & Nguyen, N.-T. & Le Thi, H.-A. (Ed.). Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications: Advanced Computational Methods for Knowledge Engineering - ICCSAMA 2015. Metz (France). Piscataway : Springer, 2015. p. 107-118. (Advances in Intelligent Systems and Computing; 358) https://archive-ouverte.unige.ch/unige:73315

184 hits

0 download

Update

Deposited on : 2015-06-23

Export document
Format :
Citation style :