{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462384,0.0002101998,0.0003713353,0.0002605821,0.000363409,0.000171438,0.0006945234,0.0001190974,0.00003713428],"category_scores_gemma":[0.002208347,0.0001270118,0.0002107871,0.0006158699,0.0001221357,0.0001616669,0.000109544,0.00008926365,0.0005662736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004079089,"about_ca_system_score_gemma":0.00005186037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003021142,"about_ca_topic_score_gemma":0.000008540007,"domain_scores_codex":[0.9975175,0.00001811151,0.0007738718,0.0005626812,0.0006741271,0.0004537095],"domain_scores_gemma":[0.9961846,0.002153963,0.0003648081,0.0008963744,0.0002495274,0.0001507467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004393563,0.0002139367,0.0004980716,0.00006336856,0.00008672447,4.965871e-7,0.001231331,0.0009940466,0.1159356,0.8404244,0.0004299951,0.04007818],"study_design_scores_gemma":[0.002483948,0.00004821503,0.0007529712,0.0001103316,0.0001308889,0.000006559266,0.001885975,0.07674291,0.01522337,0.8964067,0.005532903,0.0006752678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06141401,0.00004130537,0.9350226,0.0005593383,0.0001404361,0.0006741791,0.00003376076,0.0001781123,0.001936288],"genre_scores_gemma":[0.561452,0.000006217252,0.4374723,0.00004730522,0.00009022215,0.0003927286,0.000002680817,0.00002688481,0.0005096227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.500038,"threshold_uncertainty_score":0.7278491,"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."}}