{"id":"W2467648358","doi":"10.1016/j.dam.2016.05.023","title":"Graph multi-coloring for a job scheduling application","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Vertex (graph theory); Graph coloring; Colored; Greedy coloring; List coloring; Complete coloring; Edge coloring; Neighbourhood (mathematics); Integer programming; Graph; Discrete mathematics; Graph power; Algorithm; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045084,0.0006600384,0.0006423955,0.0005510196,0.0008323491,0.0009862887,0.001142804,0.000955997,0.005395992],"category_scores_gemma":[0.001383646,0.0002658574,0.000818127,0.001031567,0.0004236583,0.0007295096,0.0006800642,0.00113592,0.0006404848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135065,"about_ca_system_score_gemma":0.001940689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006396408,"about_ca_topic_score_gemma":0.009526768,"domain_scores_codex":[0.9997187,0.0000854538,0.00001046289,0.00006674349,0.00006573794,0.00005282767],"domain_scores_gemma":[0.9995475,0.0002418827,0.00003603106,0.00004557829,0.00007669,0.00005230742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002453671,0.0002793512,0.0009101302,0.0005015864,0.00007077465,0.0004275554,0.00015521,0.7856727,0.01523364,0.1027579,0.009019773,0.08472613],"study_design_scores_gemma":[0.00001820582,0.00004640833,0.000272274,0.00001443477,0.00001877648,0.0000689189,0.00003389825,0.9488451,0.001356266,0.04612369,0.003192,0.000009950122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06384278,0.0005192971,0.9197963,0.001355503,0.0002852709,0.0002613402,0.0004413599,0.0007406868,0.01275745],"genre_scores_gemma":[0.475726,0.0007623575,0.5023074,0.0002947455,0.0001928119,0.0002369906,0.0004747478,0.0002885841,0.01971623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006396408,"threshold_uncertainty_score":0.01805133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.131738151946533,"score_gpt":0.3866086343133353,"score_spread":0.2548704823668023,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}