{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001572848,0.001022362,0.002184605,0.001295334,0.00106674,0.001315261,0.002322167,0.001376015,0.004112469],"category_scores_gemma":[0.002909723,0.001300304,0.001258293,0.002362602,0.0004843497,0.001722808,0.001647903,0.001213458,0.0004428793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008579702,"about_ca_system_score_gemma":0.001580894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01690913,"about_ca_topic_score_gemma":0.0150254,"domain_scores_codex":[0.9992856,0.0002902499,0.00004028409,0.0001464296,0.0001581037,0.00007934598],"domain_scores_gemma":[0.9984938,0.0008504749,0.0001229321,0.0001307855,0.0002920823,0.0001099155],"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.00008988971,0.00007309925,0.0003101809,0.00003852457,0.00005787477,0.00003377683,0.00004269026,0.957522,0.0005959336,0.003696506,0.0008834249,0.03665619],"study_design_scores_gemma":[0.000005577276,0.000007877501,0.00002087528,0.00000141679,0.000004020541,0.000002001394,0.000003670085,0.9992939,0.00004908857,0.0004995144,0.0001103923,0.000001726801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01519694,0.0001193864,0.9822245,0.00008299517,0.0000516995,0.00006581921,0.00008652126,0.0002081339,0.001963926],"genre_scores_gemma":[0.2989461,0.0001581409,0.6965599,0.00009234194,0.0000877563,0.0003411475,0.0003415865,0.000240344,0.003232791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01690913,"threshold_uncertainty_score":0.03362143,"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."}}