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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Al-Anzi, F.S., Sotskov, Y.N., Allahverdi, A., Andreev, G.V.: Using Mixed Graph Coloring to Minimize Total Completion Time in Job Shop Scheduling. Applied Mathematics and Computation 182(2), 1137–1148 (2006)
Bloechliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research 35, 960–975 (2008)
Bloechliger, I., Zufferey, N.: Multi-Coloring and Project-Scheduling with Incompatibility and Assignment Costs. Annals of Operations Research 211(1), 83–101 (2013)
Brélaz, D.: New Methods to Color Vertices of a Graph. Communications of the Association for Computing Machinery 22, 251–256 (1979)
Chiarandini, M., Stuetzle, T.: Stochastic local search algorithms for graph set T-colouring and frequency assignment. Constraints 12, 371–403 (2007)
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer Academic Publishers (2002)
Dorne, R., Hao, J.-K.: Meta-heuristics: Advances and trends in local search paradigms for optimization, chapter Tabu search for graph coloring, T-colorings and set T-colorings, pp. 77–92. Kluwer, Norwell (1998)
Furmańczyk, H., Kosowski, A., Żyliński, P.: Scheduling with precedence constraints: Mixed graph coloring in series-parallel graphs. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol. 4967, pp. 1001–1008. Springer, Heidelberg (2008)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 68–82. Springer, Heidelberg (2005)
Garey, M., Johnson, D.S.: Computer and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146. Springer, Heidelberg (2010)
Halldórsson, M.M., Kortsarz, G.: Multicoloring: Problems and techniques. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 25–41. Springer, Heidelberg (2004)
Hansen, P., Kuplinsky, J., de Werra, D.: Mixed Graph Coloring. Mathematical Methods of Operations Research 45, 145–169 (1997)
Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39, 345–351 (1987)
Hertz, A., Schindl, D., Zufferey, N.: A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics 15(5), 425–450 (2009)
Icmeli, O., Erenguc, S.S., Zappe, C.J.: Project scheduling problems: A survey. International Journal of Operations & Production Management 13(11), 80–91 (1993)
Kerzner, H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling. Wiley (2003)
Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 29(3), 249–272 (2001)
Lancaster, J., Ozbayrak, M.: Evolutionary algorithms applied to project scheduling problems – a survey of the state-of-the-art. International Journal of Production Research 45(2), 425–450 (2007)
Luyet, L., Varone, S., Zufferey, N.: An Ant Algorithm for the Steiner Tree Problem in Graphs. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 42–51. Springer, Heidelberg (2007)
Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research 17(1), 1–34 (2010)
Meuwly, F.-X., Ries, B., Zufferey, N.: Solution methods for a scheduling problem with incompatibility and precedence constraints. Algorithmic Operations Research 5(2), 75–85 (2010)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24, 1097–1100 (1997)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systemsmulti-coloring. Prentice Hall (2008)
Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147–167 (1995)
Sotskov, Y.N., Dolgui, A., Werner, F.: Mixed Graph Coloring for Unit-Time Job-Shop Scheduling. International Journal of Mathematical Algorithms 2, 289–323 (2001)
Zufferey, N.: Metaheuristics: some Principles for an Efficient Design. Computer Technology and Applications 3(6), 446–462 (2012)
Zufferey, N.: Graph Coloring and Job Scheduling: from Models to Powerful Tabu Search Solution Methods. In: Proceedings of the 14th International Workshop on Project Management and Scheduling (PMS 2014), Munich, Germany, March 31 – April 2 (2014)
Zufferey, N., Amstutz, P., Giaccari, P.: Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling 11(4), 263–277 (2008)
Zufferey, N., Labarthe, O., Schindl, D.: Heuristics for a project management problem with incompatibility and assignment costs. Computational Optimization and Applications 51, 1231–1252 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zufferey, N. (2015). Graph Coloring Tabu Search for Project Scheduling. In: Le Thi, H., Nguyen, N., Do, T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 358. Springer, Cham. https://doi.org/10.1007/978-3-319-17996-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-17996-4_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17995-7
Online ISBN: 978-3-319-17996-4
eBook Packages: EngineeringEngineering (R0)