{"id":"W2039059059","doi":"10.1016/j.ejor.2011.02.009","title":"Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Column generation; Computer science; Crew scheduling; Schedule; Scheduling (production processes); Set cover problem; Constraint (computer-aided design); Mathematical optimization; Sequence (biology); Set (abstract data type); Constraint programming; Computational complexity theory; Operations research; Algorithm; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.01096992,0.000173035,0.0002362816,0.0006345825,0.0002059404,0.000155706,0.0003885786,0.00005143336,0.000643597],"category_scores_gemma":[0.001665141,0.0001530503,0.00009618116,0.0007842825,0.0001293684,0.0004147258,0.00006823862,0.0010164,0.00004198888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002435854,"about_ca_system_score_gemma":0.0003742358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006397297,"about_ca_topic_score_gemma":0.000001121083,"domain_scores_codex":[0.9953454,0.002505816,0.0008571148,0.0001768721,0.0007768623,0.0003379751],"domain_scores_gemma":[0.9973188,0.0003209974,0.0001391449,0.0001912078,0.001810048,0.000219789],"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.0001082483,0.00009140778,0.00025663,0.00004270988,0.0001424866,0.0001968449,0.001079495,0.8913208,0.04607142,0.001869533,0.0001459751,0.05867441],"study_design_scores_gemma":[0.0008123581,0.0001873209,0.001298365,0.0001774108,0.00001494774,0.0003453199,0.0003009227,0.9909499,0.004836711,0.000163836,0.0007457315,0.0001671963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03798248,0.0001266548,0.9514358,0.0001035385,0.0002244008,0.000594244,0.000007320455,0.00005705933,0.009468515],"genre_scores_gemma":[0.3899376,0.00002336984,0.6097329,0.00002428937,0.0001535315,0.000006681632,0.000005887592,0.00005482185,0.00006083853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3519551,"threshold_uncertainty_score":0.7046936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1530409330701624,"score_gpt":0.3942011772132707,"score_spread":0.2411602441431082,"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."}}