{"id":"W7149883242","doi":"","title":"Dynamic constraint aggregation for the multiple-depot bus scheduling problem","year":2025,"lang":"","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Job shop scheduling; Constraint (computer-aided design); Dynamic priority scheduling; Optimization problem","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009065382,0.001177703,0.001317822,0.0009421895,0.0008447438,0.00178253,0.001298946,0.0008035777,0.01318802],"category_scores_gemma":[0.002282204,0.0004712308,0.0006376332,0.002518901,0.0003389554,0.001164737,0.001241699,0.001587725,0.001281007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979185,"about_ca_system_score_gemma":0.002296973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02012599,"about_ca_topic_score_gemma":0.03035941,"domain_scores_codex":[0.9992523,0.0002339013,0.00002036347,0.0001548242,0.0002000378,0.0001386148],"domain_scores_gemma":[0.998955,0.0005609804,0.00009053942,0.0001148682,0.0001629307,0.0001156884],"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.0001843435,0.0002336972,0.0004664796,0.0002311101,0.00007614373,0.0001687063,0.00005617266,0.7688386,0.001511339,0.03214693,0.048632,0.1474544],"study_design_scores_gemma":[0.00003782344,0.00003323322,0.0002495548,0.00002102656,0.00001304269,0.00002927584,0.00002344465,0.9738228,0.0004084718,0.01737964,0.007972836,0.000008872301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04836098,0.001930706,0.8613408,0.002510308,0.0005308707,0.0004424678,0.004052819,0.001656814,0.07917421],"genre_scores_gemma":[0.5099187,0.001262135,0.4291714,0.000560829,0.0005137228,0.0004610104,0.005639426,0.0006790821,0.05179364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02012599,"threshold_uncertainty_score":0.04411829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01069349155701406,"score_gpt":0.2463035455933048,"score_spread":0.2356100540362907,"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."}}