{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:21:47Z","timestamp":1743074507288,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319179957"},{"type":"electronic","value":"9783319179964"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17996-4_10","type":"book-chapter","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T14:35:44Z","timestamp":1429626944000},"page":"107-118","source":"Crossref","is-referenced-by-count":0,"title":["Graph Coloring Tabu Search for Project Scheduling"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Zufferey","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/j.amc.2006.04.063","volume":"182","author":"F.S. Al-Anzi","year":"2006","unstructured":"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\u00a0182(2), 1137\u20131148 (2006)","journal-title":"Applied Mathematics and Computation"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bloechliger","year":"2008","unstructured":"Bloechliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research\u00a035, 960\u2013975 (2008)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-013-1397-1","volume":"211","author":"I. Bloechliger","year":"2013","unstructured":"Bloechliger, I., Zufferey, N.: Multi-Coloring and Project-Scheduling with Incompatibility and Assignment Costs. Annals of Operations Research\u00a0211(1), 83\u2013101 (2013)","journal-title":"Annals of Operations Research"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New Methods to Color Vertices of a Graph. Communications of the Association for Computing Machinery\u00a022, 251\u2013256 (1979)","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10601-007-9023-y","volume":"12","author":"M. Chiarandini","year":"2007","unstructured":"Chiarandini, M., Stuetzle, T.: Stochastic local search algorithms for graph set T-colouring and frequency assignment. Constraints\u00a012, 371\u2013403 (2007)","journal-title":"Constraints"},{"key":"10_CR6","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer Academic Publishers (2002)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"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\u201392. Kluwer, Norwell (1998)","DOI":"10.1007\/978-1-4615-5775-3_6"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/978-3-540-68111-3_106","volume-title":"Parallel Processing and Applied Mathematics","author":"H. Furma\u0144czyk","year":"2008","unstructured":"Furma\u0144czyk, H., Kosowski, A., \u017byli\u0144ski, 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.\u00a04967, pp. 1001\u20131008. Springer, Heidelberg (2008)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-31833-0_8","volume-title":"Approximation and Online Algorithms","author":"R. Gandhi","year":"2005","unstructured":"Gandhi, R., Halld\u00f3rsson, 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.\u00a03351, pp. 68\u201382. Springer, Heidelberg (2005)"},{"key":"10_CR10","volume-title":"Computer and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computer and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"10_CR11","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","author":"M. Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a0146. Springer, Heidelberg (2010)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-28629-5_2","volume-title":"Mathematical Foundations of Computer Science 2004","author":"M.M. Halld\u00f3rsson","year":"2004","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Multicoloring: Problems and techniques. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 25\u201341. Springer, Heidelberg (2004)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01194253","volume":"45","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Kuplinsky, J., de Werra, D.: Mixed Graph Coloring. Mathematical Methods of Operations Research\u00a045, 145\u2013169 (1997)","journal-title":"Mathematical Methods of Operations Research"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing\u00a039, 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"5","key":"10_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10732-008-9072-4","volume":"15","author":"A. Hertz","year":"2009","unstructured":"Hertz, A., Schindl, D., Zufferey, N.: A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics\u00a015(5), 425\u2013450 (2009)","journal-title":"Journal of Heuristics"},{"issue":"11","key":"10_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1108\/01443579310046454","volume":"13","author":"O. Icmeli","year":"1993","unstructured":"Icmeli, O., Erenguc, S.S., Zappe, C.J.: Project scheduling problems: A survey. International Journal of Operations & Production Management\u00a013(11), 80\u201391 (1993)","journal-title":"International Journal of Operations & Production Management"},{"key":"10_CR17","unstructured":"Kerzner, H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling. Wiley (2003)"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R. Kolisch","year":"2001","unstructured":"Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega\u00a029(3), 249\u2013272 (2001)","journal-title":"Omega"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1080\/00207540600800326","volume":"45","author":"J. Lancaster","year":"2007","unstructured":"Lancaster, J., Ozbayrak, M.: Evolutionary algorithms applied to project scheduling problems \u2013 a survey of the state-of-the-art. International Journal of Production Research\u00a045(2), 425\u2013450 (2007)","journal-title":"International Journal of Production Research"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-3-540-71805-5_5","volume-title":"Applications of Evolutionary Computing","author":"L. Luyet","year":"2007","unstructured":"Luyet, L., Varone, S., Zufferey, N.: An Ant Algorithm for the Steiner Tree Problem in Graphs. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol.\u00a04448, pp. 42\u201351. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E. Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research\u00a017(1), 1\u201334 (2010)","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10_CR22","first-page":"75","volume":"5","author":"F.-X. Meuwly","year":"2010","unstructured":"Meuwly, F.-X., Ries, B., Zufferey, N.: Solution methods for a scheduling problem with incompatibility and precedence constraints. Algorithmic Operations Research\u00a05(2), 75\u201385 (2010)","journal-title":"Algorithmic Operations Research"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"10_CR24","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systemsmulti-coloring. Prentice Hall (2008)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"key":"10_CR26","first-page":"289","volume":"2","author":"Y.N. Sotskov","year":"2001","unstructured":"Sotskov, Y.N., Dolgui, A., Werner, F.: Mixed Graph Coloring for Unit-Time Job-Shop Scheduling. International Journal of Mathematical Algorithms\u00a02, 289\u2013323 (2001)","journal-title":"International Journal of Mathematical Algorithms"},{"issue":"6","key":"10_CR27","first-page":"446","volume":"3","author":"N. Zufferey","year":"2012","unstructured":"Zufferey, N.: Metaheuristics: some Principles for an Efficient Design. Computer Technology and Applications\u00a03(6), 446\u2013462 (2012)","journal-title":"Computer Technology and Applications"},{"key":"10_CR28","unstructured":"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 \u2013 April 2 (2014)"},{"issue":"4","key":"10_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-008-0066-8","volume":"11","author":"N. Zufferey","year":"2008","unstructured":"Zufferey, N., Amstutz, P., Giaccari, P.: Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling\u00a011(4), 263\u2013277 (2008)","journal-title":"Journal of Scheduling"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1007\/s10589-010-9380-0","volume":"51","author":"N. Zufferey","year":"2012","unstructured":"Zufferey, N., Labarthe, O., Schindl, D.: Heuristics for a project management problem with incompatibility and assignment costs. Computational Optimization and Applications\u00a051, 1231\u20131252 (2012)","journal-title":"Computational Optimization and Applications"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17996-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T12:20:58Z","timestamp":1677068458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17996-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319179957","9783319179964"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17996-4_10","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}