{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T12:53:13Z","timestamp":1677070393493},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:00:00Z","timestamp":1369785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10479-013-1397-1","type":"journal-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T15:11:30Z","timestamp":1369753890000},"page":"83-101","source":"Crossref","is-referenced-by-count":8,"title":["Multi-coloring and job-scheduling with assignment and incompatibility costs"],"prefix":"10.1007","volume":"211","author":[{"given":"Ivo","family":"Bl\u00f6chliger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,29]]},"reference":[{"issue":"4","key":"1397_CR1","first-page":"261","volume":"1","author":"K. I. Aardal","year":"2003","unstructured":"Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2003). Models and solution techniques for frequency assignment problems. 4OR, 1(4), 261\u2013317.","journal-title":"4OR"},{"key":"1397_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J. C. Beck","year":"2003","unstructured":"Beck, J. C., & Refalo, P. (2003). A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research, 118, 49\u201371.","journal-title":"Annals of Operations Research"},{"key":"1397_CR3","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. (2008). A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research, 35, 960\u2013975.","journal-title":"Computers & Operations Research"},{"key":"1397_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color vertices of a graph. Communications of the Association for Computing Machinery, 22, 251\u2013256.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"1397_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Marecek, J., Parkes, A. J., & Rudova, H. (2010). A supernodal formulation of vertex colouring with applications in course timetabling. Annals of Operations Research, 179, 105\u2013130.","journal-title":"Annals of Operations Research"},{"key":"1397_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000030685.31167.11","volume":"129","author":"Z. L. Chen","year":"2004","unstructured":"Chen, Z. L. (2004). Simultaneous job scheduling and resource allocation on parallel machines. Annals of Operations Research, 129, 135\u2013153.","journal-title":"Annals of Operations Research"},{"key":"1397_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10601-007-9023-y","volume":"12","author":"M. Chiarandini","year":"2007","unstructured":"Chiarandini, M., & Stuetzle, T. (2007). Stochastic local search algorithms for graph set T-colouring and frequency assignment. Constraints, 12, 371\u2013403.","journal-title":"Constraints"},{"issue":"4","key":"1397_CR8","first-page":"743","volume":"14","author":"E. G. Coffman","year":"1985","unstructured":"Coffman, E. G., Garey, M. R., Johnson, D. S., & Lapaugh, A. S. (1985). Scheduling file transfers. SIAM Journal on Computing, 14(4), 743\u2013780.","journal-title":"SIAM Journal on Computing"},{"key":"1397_CR9","volume-title":"Project scheduling: a research handbook","author":"E. L. Demeulemeester","year":"2002","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (2002). Project scheduling: a research handbook. Dordrecht: Kluwer Academic."},{"key":"1397_CR10","first-page":"77","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., & Hao, J.-K. (1998). Tabu search for graph coloring, T-colorings and set T-colorings. In Meta-heuristics: advances and trends in local search paradigms for optimization (pp. 77\u201392). Norwell: Kluwer Academic."},{"key":"1397_CR11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10878-006-9003-y","volume":"12","author":"G. Dosa","year":"2006","unstructured":"Dosa, G., & He, Y. (2006). Scheduling with machine cost and rejection. Journal of Combinatorial Optimization, 12, 337\u2013350.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1397_CR12","first-page":"1","volume":"1","author":"J. Duives","year":"2011","unstructured":"Duives, J., Lodi, A., & Malaguti, E. (2011). Test-assignment: a quadratic coloring problem. Journal of Heuristics, 1, 1\u201316.","journal-title":"Journal of Heuristics"},{"key":"1397_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-007-0284-z","volume":"159","author":"G. Feng","year":"2008","unstructured":"Feng, G., & Lau, H. C. (2008). Efficient algorithms for machine scheduling problems with earliness and tardiness penalties. Annals of Operations Research, 159, 83\u201395.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"1397_CR14","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. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4), 379\u2013397.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1397_CR15","first-page":"309","volume-title":"Proceedings of GLOBECOM IEEE","author":"A. Gamst","year":"1982","unstructured":"Gamst, A., & Rave, W. (1982). On the frequency assignment in mobile automatic telephone systems. In Proceedings of GLOBECOM IEEE, 29 November\u20132 December (pp. 309\u2013315)."},{"key":"1397_CR16","first-page":"68","volume-title":"Lecture notes in computer science","author":"R. Gandhi","year":"2005","unstructured":"Gandhi, R., Halldorsson, M. M., Kortsarz, G., & Shachnai, H. (2005). Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria. In Lecture notes in computer science (Vol.\u00a03351, pp. 68\u201382)."},{"key":"1397_CR17","volume-title":"Computer and intractability: a guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. S. (1979). Computer and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"1397_CR18","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. (2010). International series in operations research & management science: Vol.\u00a0146. Handbook of metaheuristics. Berlin: Springer."},{"key":"1397_CR19","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. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"1397_CR20","volume-title":"Lecture notes in computer science","author":"M. M. Halldorsson","year":"2004","unstructured":"Halldorsson, M. M. (2004). Multicoloring: problems and techniques. In Lecture notes in computer science (Vol.\u00a03153)."},{"key":"1397_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., & de Werra, D. (1987). Using tabu search techniques for graph coloring. Computing, 39, 345\u2013351.","journal-title":"Computing"},{"key":"1397_CR22","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. (2008). Variable space search for graph coloring. Discrete Applied Mathematics, 156, 2551\u20132560.","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"1397_CR23","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. (1993). Project scheduling problems: a survey. International Journal of Operations & Production Management, 13(11), 80\u201391.","journal-title":"International Journal of Operations & Production Management"},{"key":"1397_CR24","volume-title":"Project management: a systems approach to planning, scheduling, and controlling","author":"H. Kerzner","year":"2003","unstructured":"Kerzner, H. (2003). Project management: a systems approach to planning, scheduling, and controlling. New York: Wiley."},{"issue":"3","key":"1397_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. (2001). An integrated survey of deterministic project scheduling. Omega, 29(3), 249\u2013272.","journal-title":"Omega"},{"issue":"2","key":"1397_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1080\/00207540600800326","volume":"45","author":"J. Lancaster","year":"2007","unstructured":"Lancaster, J., & Ozbayrak, M. (2007). Evolutionary algorithms applied to project scheduling problems\u2014a\u00a0survey of the state-of-the-art. International Journal of Production Research, 45(2), 425\u2013450.","journal-title":"International Journal of Production Research"},{"key":"1397_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. (1979). A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84, 489\u2013505.","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"2","key":"1397_CR28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(01)00251-4","volume":"82","author":"Z. Liu","year":"2002","unstructured":"Liu, Z. & Cheng, T. C. E., & (2002). Scheduling with job release dates, delivery times and preemption penalties. Information Processing Letters, 82(2), 107\u2013111.","journal-title":"Information Processing Letters"},{"key":"1397_CR29","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. Lu","year":"2010","unstructured":"Lu, Z., & Hao, J.-K. (2010). A memetic algorithm for graph coloring. European Journal of Operational Research, 203, 241\u2013250.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1397_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E. Malaguti","year":"2010","unstructured":"Malaguti, E., & Toth, P. (2010). A survey on vertex coloring problems. International Transactions in Operational Research, 17(1), 1\u201334.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"1397_CR31","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. (2008). A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing, 20(2), 302\u2013316.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1397_CR32","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/09537280110069649","volume":"13","author":"A. S. Mendes","year":"2002","unstructured":"Mendes, A. S., Muller, F. M., Fran\u00e7a, P. M., & Moscato, P. (2002). Comparing meta-heuristic approaches for parallel machine scheduling problems. Production Planning & Control, 13(2), 143\u2013154.","journal-title":"Production Planning & Control"},{"key":"1397_CR33","doi-asserted-by":"crossref","unstructured":"Mohammadi, E., & Heydari, M. (2011). Single machine scheduling problem with minimax criteria and preemption penalties. Computer Science and Automation Engineering (CSAE) 440\u2013444. doi: 10.1109\/CSAE.2011.5953257","DOI":"10.1109\/CSAE.2011.5953257"},{"key":"1397_CR34","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I. H. Osman","year":"1996","unstructured":"Osman, I. H., & Laporte, G. (1996). Metaheuristics: a bibliography. Annals of Operations Research, 63, 513\u2013623.","journal-title":"Annals of Operations Research"},{"key":"1397_CR35","first-page":"509","volume":"34","author":"S. S. Panwalkar","year":"2002","unstructured":"Panwalkar, S. S., & Liman, S. D. (2002). Single operation earliness-tardiness scheduling with machine activation costs. IIE Transactions, 34, 509\u2013513.","journal-title":"IIE Transactions"},{"key":"1397_CR36","volume-title":"Scheduling: theory, algorithms, and systems multi-coloring","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: theory, algorithms, and systems multi-coloring. New York: Prentice Hall."},{"key":"1397_CR37","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. (2010). Ant local search and its efficient adaptation to graph colouring. Journal of the Operational Research Society, 61, 819\u2013826.","journal-title":"Journal of the Operational Research Society"},{"key":"1397_CR38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., & Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"issue":"7","key":"1397_CR39","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1080\/09537280701582422","volume":"18","author":"P. Rogers","year":"2007","unstructured":"Rogers, P., & Nandi, A. (2007). Judicious order acceptance and order release in make-to-order manufacturing systems. Production Planning & Control, 18(7), 610\u2013625.","journal-title":"Production Planning & Control"},{"key":"1397_CR40","first-page":"759","volume-title":"Proceedings of the 10th annual acm-siam symposium on discrete algorithms soda\u201999","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., & Woeginger, G. J. (1999). Preemptive scheduling with job-dependent setup times. In Proceedings of the 10th annual acm-siam symposium on discrete algorithms soda\u201999 (pp. 759\u2013767)."},{"key":"1397_CR41","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.cor.2006.08.017","volume":"35","author":"D. Shabtay","year":"2008","unstructured":"Shabtay, D. (2008). Due date assignments and scheduling a single machine with a general earliness\/tardiness cost function. Computers & Operations Research, 35, 1539\u20131545.","journal-title":"Computers & Operations Research"},{"key":"1397_CR42","series-title":"Lecture notes in computer science","first-page":"203","volume-title":"Algorithms esa 2002","author":"H. Shachnai","year":"2002","unstructured":"Shachnai, H., Tami, T., & Woeginger, G. (2002). Minimizing makespan and preemption costs on a system of uniform machines. In R. Mring & R. Raman (Eds.), Lecture notes in computer science: Vol.\u00a02461. Algorithms esa 2002 (pp. 203\u2013212). Berlin: Springer."},{"issue":"1","key":"1397_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"S. A. Slotnick","year":"2011","unstructured":"Slotnick, S. A. (2011). Order acceptance and scheduling: a taxonomy and review. European Journal of Operational Research, 212(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"key":"1397_CR44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02023765","volume":"3","author":"K. Stecke","year":"1985","unstructured":"Stecke, K. (1985). Design planning, scheduling and control problems of flexible manufacturing. Annals of Operations Research, 3, 3\u201312.","journal-title":"Annals of Operations Research"},{"key":"1397_CR45","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"H. Sun","year":"2005","unstructured":"Sun, H., Wang, G., & Chu, C. (2005). Preemptive scheduling with availability constraints to minimize total weighted completion times. Annals of Operations Research, 133, 183\u2013192.","journal-title":"Annals of Operations Research"},{"key":"1397_CR46","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1051\/ro:2001109","volume":"35","author":"V. T\u2019Kindt","year":"2001","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2001). Multicriteria scheduling problem: a survey. RAIRO, Operations Research, 35, 143\u2013163.","journal-title":"RAIRO, Operations Research"},{"key":"1397_CR47","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1007\/s10845-009-0260-3","volume":"21","author":"M. D. Toksari","year":"2010","unstructured":"Toksari, M. D. & Guner, E. (2010). Parallel machine scheduling problem to minimize the earliness\/tardiness costs with learning effect and deteriorating jobs. Journal of Intelligent Manufacturing, 21, 843\u2013851.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1397_CR48","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.cie.2007.02.005","volume":"53","author":"B. Yang","year":"2007","unstructured":"Yang, B., & Geunes, J. (2007). A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times. Computers & Industrial Engineering, 53, 420\u2013432.","journal-title":"Computers & Industrial Engineering"},{"key":"1397_CR49","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/S0305-0548(03)00080-7","volume":"31","author":"B. Yang","year":"2004","unstructured":"Yang, B., Geunes, J., & O\u2019Brien, W. J. (2004). A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling. Computers & Operations Research, 31, 1273\u20131301.","journal-title":"Computers & Operations Research"},{"key":"1397_CR50","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.ijpe.2007.08.005","volume":"112","author":"M. Zorzini","year":"2008","unstructured":"Zorzini, M., Corti, D., & Pozzetti, A. (2008). Due date (DD) quotation and capacity planning in make-to-order companies: results from an empirical analysis. International Journal of Production Economics, 112, 919\u2013933.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"1397_CR51","first-page":"446","volume":"3","author":"N. Zufferey","year":"2012","unstructured":"Zufferey, N. (2012). Metaheuristics: some principles for an efficient design. Computer Technology and Applications, 3(6), 446\u2013462.","journal-title":"Computer Technology and Applications"},{"issue":"4","key":"1397_CR52","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. (2008). Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling, 11(4), 263\u2013277.","journal-title":"Journal of Scheduling"},{"key":"1397_CR53","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1007\/s10589-010-9380-0","volume":"51","author":"N. Zufferey","year":"2012","unstructured":"Zufferey, N., Labarthe, O., & Schindl, D. (2012). Heuristics for a project management problem with incompatibility and assignment costs. Computational Optimization and Applications, 51, 1231\u20131252.","journal-title":"Computational Optimization and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1397-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1397-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1397-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:43Z","timestamp":1559153383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1397-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,29]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1397"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1397-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,29]]}}}