{"id":"W3110716649","doi":"10.3233/idt-190114","title":"A new approach based on graph matching and evolutionary approach for sport scheduling problem","year":2020,"lang":"en","type":"article","venue":"Intelligent Decision Technologies","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Crossover; Tournament; Tournament selection; Mathematical optimization; Computer science; Schedule; Genetic algorithm; Scheduling (production processes); Constructive; Job shop scheduling; Operator (biology); Graph; Evolutionary algorithm; Operations research; Heuristic; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics","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":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002188432,0.0003727767,0.0005978683,0.0009541828,0.0004909605,0.0004031611,0.001493423,0.0003687493,0.00004438122],"category_scores_gemma":[0.008783027,0.0002768887,0.0003242934,0.002075095,0.0002086577,0.0002428274,0.0003676908,0.0005249219,0.0001454679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005869633,"about_ca_system_score_gemma":0.0002187309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001475439,"about_ca_topic_score_gemma":5.028729e-7,"domain_scores_codex":[0.9955312,0.00004280035,0.001055148,0.001451197,0.001379195,0.0005404797],"domain_scores_gemma":[0.9961972,0.001879728,0.0003245952,0.0009383105,0.0004359926,0.0002241402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004943789,0.0002927204,0.001444603,0.00003698765,0.00005396353,0.000005537273,0.0003287894,0.4143638,0.0002052307,0.02894825,0.01234441,0.5414813],"study_design_scores_gemma":[0.0005942377,0.000239902,0.0001199905,0.00007182781,0.00003890614,0.00001519066,0.005385155,0.4200948,0.002456023,0.5627583,0.007794083,0.0004315804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01092307,0.001063541,0.98003,0.004496261,0.0001394929,0.0008304823,0.00002217251,0.001128525,0.001366462],"genre_scores_gemma":[0.3696227,0.00005000784,0.6297278,0.0002950878,0.00005315895,0.00008020602,0.00001339137,0.00002360213,0.0001340902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5410497,"threshold_uncertainty_score":0.9999683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1264925375277027,"score_gpt":0.3519364273568067,"score_spread":0.225443889829104,"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."}}