{"id":"W2074413296","doi":"10.1002/net.21587","title":"Timing problems and algorithms: Time decisions for sequences of activities","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Concatenation (mathematics); Vehicle routing problem; Inference; Combinatorial optimization; Algorithm; Mathematical optimization; Routing (electronic design automation); Artificial intelligence; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004636889,0.002125031,0.001370757,0.001256421,0.0009887499,0.004051202,0.002427633,0.002489881,0.008111279],"category_scores_gemma":[0.01894692,0.0009033766,0.001729826,0.002909261,0.002779084,0.006363522,0.002266225,0.003303826,0.001411378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002311788,"about_ca_system_score_gemma":0.002662452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002098409,"about_ca_topic_score_gemma":0.001534,"domain_scores_codex":[0.9958002,0.001816899,0.0003187003,0.001025176,0.0008081596,0.0002308082],"domain_scores_gemma":[0.992235,0.005984904,0.0006981214,0.0005554477,0.0003562474,0.0001702823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009089349,0.00006077316,0.0005781011,0.0003073505,0.00006760889,0.00007156745,0.0001840559,0.345994,0.0006110591,0.5639596,0.004467846,0.08360721],"study_design_scores_gemma":[0.00003448756,0.00005990842,0.0001382438,0.00008223546,0.0000269438,0.00006946079,0.00006125247,0.4872042,0.0005639063,0.4994669,0.01227001,0.00002243575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002970166,0.001381021,0.989193,0.000595267,0.0001291601,0.00009746187,0.0001311903,0.00009787636,0.005404821],"genre_scores_gemma":[0.1558831,0.004797922,0.8252205,0.0004135239,0.0008290212,0.0008145852,0.0007602735,0.0003408977,0.0109402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008111279,"threshold_uncertainty_score":0.0271349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06351391128462434,"score_gpt":0.2892708729540661,"score_spread":0.2257569616694418,"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."}}