{"id":"W2030845314","doi":"10.1109/itsc.2012.6338637","title":"Revisit the fairness issues in flight landing scheduling","year":2012,"lang":"en","type":"article","venue":"","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Fairness measure; Scheduling (production processes); Schedule; Heuristic; Air traffic control; Mathematical optimization; Max-min fairness; Term (time); Operations research; Scheme (mathematics); Throughput; Distributed computing; Computer network; Resource allocation; Engineering; Artificial intelligence; Aerospace engineering","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.0001659079,0.00005180844,0.00005139335,0.00003900322,0.00002675849,0.00002426778,0.00006329463,0.00002121703,0.0002030947],"category_scores_gemma":[0.000006908177,0.00003477974,0.00001228514,0.0001308251,0.000004242698,0.0001817492,0.00001505893,0.00004914679,0.00006348091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001484662,"about_ca_system_score_gemma":5.404162e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004654344,"about_ca_topic_score_gemma":0.000008131994,"domain_scores_codex":[0.9996826,0.000007764804,0.00007943591,0.00003866134,0.00005279356,0.0001387178],"domain_scores_gemma":[0.9998829,0.0000149877,0.000006043223,0.00007680259,0.000004009224,0.00001523882],"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.000002780868,0.00002087235,0.04521913,0.0001374772,0.00002937775,0.000001214635,0.002294277,0.8892877,0.00008218085,0.04476412,0.006384244,0.01177665],"study_design_scores_gemma":[0.000175938,0.000002991956,0.007184093,0.00005169218,0.0000110997,5.360582e-7,0.0006691414,0.9396324,0.0004333391,0.00004952978,0.05161547,0.0001738219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2005009,0.005894057,0.4906479,0.001703822,0.001103176,0.0004981655,4.567319e-7,0.00115977,0.2984918],"genre_scores_gemma":[0.9959155,0.0001842633,0.002694537,0.00003078075,0.0001548204,0.000005150381,0.00000310865,0.000009272397,0.001002581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7954146,"threshold_uncertainty_score":0.2223745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009574741231578098,"score_gpt":0.2198923677270714,"score_spread":0.2103176264954933,"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."}}