{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:13:46Z","timestamp":1649193226978},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,29]],"date-time":"2012-09-29T00:00:00Z","timestamp":1348876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10951-012-0291-z","type":"journal-article","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T12:33:55Z","timestamp":1349008435000},"page":"681-702","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable"],"prefix":"10.1007","volume":"15","author":[{"given":"I.","family":"Nieuwoudt","sequence":"first","affiliation":[]},{"given":"J. H.","family":"van Vuuren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,29]]},"reference":[{"key":"291_CR1","unstructured":"AIMMS (2012). CPLEX solver for linear and mixed integer programming [Online], [Cited: March 4th, 2012]. Available from: http:\/\/www.aimms.com\/features\/solvers\/cplex ."},{"key":"291_CR2","unstructured":"Alcatel-Lucent Space Technologies (2011). Alcatel-Lucent: at the speed of ideas [Online], [Cited: December 29th, 2011]. Available from: http:\/\/www.alcatel-lucent.com ."},{"key":"291_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/INFCOM.2005.1497923","volume-title":"Proceedings of the 24th annual joint conference of the IEEE computer and communications societies held","author":"S. Alouf","year":"2005","unstructured":"Alouf, S., Altman, E., Galtier, J., Lalande, J.-F., & Touati, C. (2005). Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites. In Proceedings of the 24th annual joint conference of the IEEE computer and communications societies held, 13\u201317 March 2005, Miami (Florida) (Vol.\u00a01, pp.\u00a0560\u2013571)."},{"key":"291_CR4","first-page":"33","volume":"47","author":"J. A. Andrews","year":"1985","unstructured":"Andrews, J. A., & Jacobson, M. S. (1985). On a generalization of chromatic number. Congressus Numerantium, 47, 33\u201348.","journal-title":"Congressus Numerantium"},{"key":"291_CR5","first-page":"97","volume":"23","author":"JA Andrews","year":"1987","unstructured":"Andrews, JA, & Jacobson, M. S. (1987). On a generalization of chromatic number and two kinds of Ramsey numbers. Ars Combinatoria, 23, 97\u2013102.","journal-title":"Ars Combinatoria"},{"key":"291_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(95)00301-C","volume":"162","author":"G. Benad\u00e9","year":"1996","unstructured":"Benad\u00e9, G., Broere, I., Jonck, B., & Frick, M. (1996). Uniquely (m,k) \u03c4 -colourable graphs and k-\u03c4-saturated graphs. Discrete Mathematics, 162, 13\u201322.","journal-title":"Discrete Mathematics"},{"issue":"4","key":"291_CR7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.20218","volume":"51","author":"C. Bentz","year":"2008","unstructured":"Bentz, C., Costa, M. C., de\u00a0Werra, D., Picouleau, C., & Ries, B. (2008). On a graph coloring problem arising from discrete tomography. Networks, 51(4), 256\u2013267.","journal-title":"Networks"},{"key":"291_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D. (1979). New methods to colour the vertices of a graph. Communications of the Association for Computing Machinery, 22, 251\u2013256.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"291_CR9","first-page":"179","volume-title":"Graph theory, combinatorics and applications: proceedings of the sixth quadrennial international conference on the theory and applications of graphs","author":"I. Broere","year":"1991","unstructured":"Broere, I., & Frick, M. (1991). A characterization of the sequence of generalized chromatic numbers of a graph. In Graph theory, combinatorics and applications: proceedings of the sixth quadrennial international conference on the theory and applications of graphs (pp.\u00a0179\u2013186). New York: Wiley."},{"key":"291_CR10","first-page":"125","volume":"47","author":"I. Broere","year":"1985","unstructured":"Broere, I., & Frick, M. (1985). On the order of colour critical graphs. Congressus Numerantium, 47, 125\u2013130.","journal-title":"Congressus Numerantium"},{"key":"291_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(90)90200-2","volume":"82","author":"I. Broere","year":"1990","unstructured":"Broere, I., & Frick, M. (1990a). On the order of uniquely (k,m)-colourable graphs. Discrete Mathematics, 82, 225\u2013232.","journal-title":"Discrete Mathematics"},{"key":"291_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1080\/16073606.1990.9631611","volume":"13","author":"I. Broere","year":"1990","unstructured":"Broere, I., & Frick, M. (1990b). Two results on generalized chromatic numbers. Quaestiones Mathematicae, 13, 183\u2013190.","journal-title":"Quaestiones Mathematicae"},{"issue":"4","key":"291_CR13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"J. R. Brown","year":"1972","unstructured":"Brown, J. R. (1972). Chromatic scheduling and the chromatic number problem. Management Science, 19(4), 456\u2013463.","journal-title":"Management Science"},{"key":"291_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(96)00096-0","volume":"69","author":"J. I. Brown","year":"1996","unstructured":"Brown, J. I. (1996). The complexity of generalized graph colourings. Discrete Applied Mathematics, 69, 257\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"291_CR15","unstructured":"Burger, A. P., & Grobler, P. J. P. (1993). Aspects of (m,k)-colourings (Research Report 146\/93(7)). University of South Africa, Pretoria."},{"key":"291_CR16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0305004100042808","volume":"64","author":"G. Chartrand","year":"1968","unstructured":"Chartrand, G., Geller, D. P., & Hedetniemi, S. T. (1968). A generalization of the chromatic number. Proceedings of the Cambridge Philosophical Society, 64, 265\u2013271.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"291_CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.disopt.2009.04.005","volume":"6","author":"M. C. Costa","year":"2009","unstructured":"Costa, M. C., de\u00a0Werra, D., Picouleau, C., & Ries, B. (2009). Graph coloring with cardinality constraints on the neighbourhoods. Discrete Optimization, 6, 362\u2013369.","journal-title":"Discrete Optimization"},{"key":"291_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L. Cowen","year":"1986","unstructured":"Cowen, L., Cowen, R., & Woodall, D. (1986). Defective colourings of graphs in surfaces: Partitions into subgraphs of bounded valence. Journal of Graph Theory, 10, 187\u2013195.","journal-title":"Journal of Graph Theory"},{"key":"291_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24","author":"L. Cowen","year":"1997","unstructured":"Cowen, L., Goddard, W., & Jesurum, C. E. (1997). Defective colouring revisited. Journal of Graph Theory, 24, 205\u2013219.","journal-title":"Journal of Graph Theory"},{"key":"291_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-5060(08)70374-1","volume":"55","author":"M. Frick","year":"1993","unstructured":"Frick, M. (1993). A survey of (m,k)-colourings, quo vadis, graph theory? Annals of Discrete Mathematics, 55, 45\u201358.","journal-title":"Annals of Discrete Mathematics"},{"key":"291_CR21","unstructured":"Frick, M. (1986). Generalised colourings of graphs. Ph.D.-dissertation, Rand Afrikaans University, Johannesburg."},{"key":"291_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.7151\/dmgt.1150","volume":"21","author":"M. Frick","year":"2001","unstructured":"Frick, M., & Bullock, F. (2001). Detour chromatic numbers. Discussiones Mathematicae Graph Theory, 21, 283\u2013291.","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"291_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(94)90260-7","volume":"126","author":"M. Frick","year":"1994","unstructured":"Frick, M., & Henning, M. A. (1994). Extremal results on defective colourings of graphs. Discrete Mathematics, 126, 151\u2013158.","journal-title":"Discrete Mathematics"},{"key":"291_CR24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(91)90166-Y","volume":"91","author":"W. Goddard","year":"1991","unstructured":"Goddard, W. (1991). Acyclic colourings of planar graphs. Discrete Mathematics, 91, 91\u201394.","journal-title":"Discrete Mathematics"},{"key":"291_CR25","first-page":"127","volume-title":"Graphs and applications, proceedings of the 1st Colorado symposium on graph theory","author":"F. Harary","year":"1985","unstructured":"Harary, F. (1985). Conditional colourability in graphs. In Graphs and applications, proceedings of the 1st Colorado symposium on graph theory (pp.\u00a0127\u2013136). New York: Wiley."},{"key":"291_CR26","first-page":"205","volume":"50","author":"F. Harary","year":"1985","unstructured":"Harary, F., & Jones, K. (1985). Conditional colourability II: Bipartite variations. Congressus Numerantium, 50, 205\u2013218.","journal-title":"Congressus Numerantium"},{"key":"291_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/944618.944619","volume":"7","author":"F. Herrmann","year":"2002","unstructured":"Herrmann, F., & Hertz, A. (2002). Finding the chromatic number by means of critical graphs. The ACM Journal of Experimental Algorithmics, 7, 1\u201312.","journal-title":"The ACM Journal of Experimental Algorithmics"},{"key":"291_CR28","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 colouring. Computing, 39, 345\u2013351.","journal-title":"Computing"},{"key":"291_CR29","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1111\/j.1749-6632.1989.tb16408.x","volume":"576","author":"G. Johns","year":"1989","unstructured":"Johns, G., & Saba, F. (1989). On the path chromatic number of a graph. Annals of the New York Academy of Sciences, 576, 275\u2013280.","journal-title":"Annals of the New York Academy of Sciences"},{"issue":"3","key":"291_CR30","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. (1991). Optimization by simulated annealing: An experimental evaluation\u2014Part II: Graph colouring and number partitioning. Operations Research, 39(3), 378\u2013406.","journal-title":"Operations Research"},{"key":"291_CR31","unstructured":"Johnson, D. S., & Trick, M. A. (2006). DIMACS series in discrete mathematics and theoretical computer science [Online], [Cited November 29th, 2006]. Available from: http:\/\/dimacs.rutgers.edu\/Volumes\/Vol26.html ."},{"key":"291_CR32","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski, J. (1955). Sur le coloriage des graphes. Colloquium Mathematicum, 3, 161\u2013162.","journal-title":"Colloquium Mathematicum"},{"key":"291_CR33","unstructured":"Nieuwoudt, I. (2007). On the maximum degree chromatic number of a graph. Ph.D.-Dissertation, Stellenbosch University, Stellenbosch."},{"issue":"8","key":"291_CR34","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/358161.358171","volume":"26","author":"J. Peem\u00f6ller","year":"1983","unstructured":"Peem\u00f6ller, J. (1983). A correction to Brelaz\u2019s modification of Brown\u2019s colouring algorithm. Communications of the Association for Computing Machinery, 26(8), 595\u2013597.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"291_CR35","first-page":"175","volume-title":"Recent progress in combinatorics, Proceedings of the third Waterloo conference on combinatorics","author":"H. Sachs","year":"1969","unstructured":"Sachs, H. (1969). Finite graphs. In Recent progress in combinatorics, Proceedings of the third Waterloo conference on combinatorics (pp.\u00a0175\u2013184). New York: Academic Press."},{"key":"291_CR36","unstructured":"Trick, M. A. (2003). Network resources for colouring a graph [Online], [Cited May 28th, 2003]. Available from: http:\/\/mat.gsia.cmu.edu\/COLOR\/color.html ."},{"key":"291_CR37","unstructured":"Wikipedia\u2014The free exncyclopedia (2011). Time division multiple access [Online], [Cited: December 29th, 2011]. Available from: http:\/\/en.wikipedia.org\/wiki\/Timedivisionmultipleaccess ."},{"key":"291_CR38","unstructured":"Wolfram Research Inc. (2009). Wolfram Mathematica 7 [Online], [Cited June 7th, 2009]. Available from: http:\/\/www.wolfram.com\/products\/mathematica\/index.html ."},{"key":"291_CR39","series-title":"Pitman Research Notes in Mathematics Series","volume-title":"Graph colourings","author":"D. Woodall","year":"1990","unstructured":"Woodall, D. (1990). Improper colourings of graphs. In Graph colourings. Pitman Research Notes in Mathematics Series. Harlow: Longman Scientific and Technical."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0291-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0291-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0291-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T05:18:28Z","timestamp":1562217508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0291-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,29]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0291-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,29]]}}}