{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T16:12:53Z","timestamp":1692288773680},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T00:00:00Z","timestamp":1291248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10589-010-9380-0","type":"journal-article","created":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T12:51:21Z","timestamp":1291207881000},"page":"1231-1252","source":"Crossref","is-referenced-by-count":8,"title":["Heuristics for a project management problem with\u00a0incompatibility and assignment costs"],"prefix":"10.1007","volume":"51","author":[{"given":"Nicolas","family":"Zufferey","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Labarthe","sequence":"additional","affiliation":[]},{"given":"David","family":"Schindl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,2]]},"reference":[{"key":"9380_CR1","doi-asserted-by":"crossref","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. Comput. Oper. Res. 35, 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9380_CR2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"D. Chams","year":"1987","unstructured":"Chams, D., Hertz, A., de Werra, D.: Some experiments with simulated annealing for coloring graphs. Eur. J. Oper. Res. 32, 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"9380_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"Charon, I., Hudry, O.: The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14, 133\u2013137 (1993)","journal-title":"Oper. Res. Lett."},{"key":"9380_CR4","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Reinhold, New York (1991)"},{"key":"9380_CR5","volume-title":"Project Scheduling: A Research Handbook","author":"E.L. Demeulemeester","year":"2002","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer Academic, Norwell (2002)"},{"issue":"2\u20133","key":"9380_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2\u20133), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9380_CR7","first-page":"367","volume-title":"Metaheuristics: Progress as Real Problem Solvers, vol.\u00a017","author":"A. Dupond","year":"2005","unstructured":"Dupond, A., Vasquez, M., Habet, D.: Consistent neighbourhood in a tabu search. In: Metaheuristics: Progress as Real Problem Solvers, vol.\u00a017, pp.\u00a0367\u2013386. Springer, Berlin (2005)"},{"key":"9380_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9380_CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63(3), 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9380_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"9380_CR11","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Comput. Oper. Res. 33, 2547\u20132562 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9380_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P. Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the graph coloring problem. Discrete Appl. Math. 156, 267\u2013279 (2008)","journal-title":"Discrete Appl. Math."},{"key":"9380_CR13","first-page":"309","volume-title":"Proceedings of GLOBECOM IEEE","author":"A. Gamst","year":"1982","unstructured":"Gamst, A., Rave, W.: On the frequency assignment in mobile automatic telephone systems. In: Proceedings of GLOBECOM IEEE, Miami, United States, 29 November\u20132 December 1982, pp.\u00a0309\u2013315 (1982)"},{"key":"9380_CR14","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":"9380_CR15","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1057\/palgrave.jors.2601316","volume":"53","author":"C. Glass","year":"2002","unstructured":"Glass, C.: Bag rationalisation for a food manufacturer. J. Oper. Res. Soc. 53, 544\u2013551 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"9380_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"issue":"10","key":"9380_CR17","first-page":"1","volume":"7","author":"F. Herrmann","year":"2002","unstructured":"Herrmann, F., Hertz, A.: Finding the chromatic number by means of critical graphs. ACM J. Exp. Algorithmics 7(10), 1\u20139 (2002)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"2","key":"9380_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W. Herroelen","year":"2005","unstructured":"Herroelen, W., Leus, R.: Project scheduling under uncertainty: survey and research potentials. Eur. J. Oper. Res. 165(2), 289\u2013306 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9380_CR19","doi-asserted-by":"crossref","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 39, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"9380_CR20","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A. Hertz","year":"2008","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring. Discrete Appl. Math. 156, 2551\u20132560 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"9380_CR21","doi-asserted-by":"crossref","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. Int. J. Oper. Prod. Manag. 13(11), 80\u201391 (1993)","journal-title":"Int. J. Oper. Prod. Manag."},{"key":"9380_CR22","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an\u00a0experimental evaluation, Part II: Graph coloring and number partitioning. Oper. Res. 39, 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"9380_CR23","volume-title":"Project Management: A Systems Approach to Planning, Scheduling, and Controlling","author":"H. Kerzner","year":"2003","unstructured":"Kerzner, H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling. Wiley, New York (2003)"},{"issue":"5498","key":"9380_CR24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.: Optimization by simulated annealing. Science 220(5498), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"9380_CR25","doi-asserted-by":"crossref","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 29(3), 249\u2013272 (2001)","journal-title":"Omega"},{"issue":"2","key":"9380_CR26","doi-asserted-by":"crossref","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\u2014a\u00a0survey of the state-of-the-art. Int. J. Prod. Res. 45(2), 425\u2013450 (2007)","journal-title":"Int. J. Prod. Res."},{"key":"9380_CR27","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Stand. 84, 489\u2013505 (1979)","journal-title":"J. Res. Nat. Bur. Stand."},{"issue":"2","key":"9380_CR28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20(2), 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9380_CR29","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.: A column generation approach for graph coloring. INFORMS J. Comput. 8(4), 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"key":"9380_CR30","doi-asserted-by":"crossref","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. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9380_CR31","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, New York (2002)"},{"key":"9380_CR32","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1057\/jors.2009.27","volume":"61","author":"M. Plumettaz","year":"2010","unstructured":"Plumettaz, M., Schindl, D., Zufferey, N.: Ant local search and its efficient adaptation to graph colouring. J. Oper. Res. Soc. 61, 819\u2013826 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"9380_CR33","doi-asserted-by":"crossref","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. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"9380_CR34","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02023765","volume":"3","author":"K. Stecke","year":"1985","unstructured":"Stecke, K.: Design planning, scheduling and control problems of flexible manufacturing. Ann. Oper. Res. 3, 3\u201312 (1985)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9380_CR35","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C. Voudouris","year":"1999","unstructured":"Voudouris, C., Tsang, E.: Guided local search. Eur. J. Oper. Res. 113(2), 469\u2013499 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9380_CR36","doi-asserted-by":"crossref","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. J. Sched. 11(4), 263\u2013277 (2008)","journal-title":"J. Sched."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9380-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-010-9380-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9380-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:39Z","timestamp":1559288199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-010-9380-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,2]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s10589-010-9380-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,2]]}}}