Proceedings chapter

Graph Coloring Tabu Search for Project Scheduling

ContributorsZufferey, Nicolasorcid
Presented at Metz (France), 11-13 May 2015
PublisherPiscataway : Springer
  • Advances in Intelligent Systems and Computing; 358
Publication date2015

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.

  • Graph coloring
  • Tabu search
  • Project scheduling
  • Combinatorial optimization
  • Metaheuristics
Citation (ISO format)
ZUFFEREY, Nicolas. Graph Coloring Tabu Search for Project Scheduling. In: 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) doi: 10.1007/978-3-319-17996-4_10
Main files (1)
Proceedings chapter (Accepted version)

Technical informations

Creation06/08/2015 3:25:00 PM
First validation06/08/2015 3:25:00 PM
Update time03/14/2023 11:23:16 PM
Status update03/14/2023 11:23:15 PM
Last indexation01/16/2024 6:15:48 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack