{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423377,0.00007209419,0.0001392724,0.00003694257,0.00003042643,0.00001947136,0.00005813933,0.00006936606,0.000005729735],"category_scores_gemma":[0.00009344509,0.00007003643,0.00002019938,0.00009172564,0.00003284944,0.00009573996,0.00001947768,0.00006302635,7.892072e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001815962,"about_ca_system_score_gemma":0.00001110341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002550745,"about_ca_topic_score_gemma":0.000001031591,"domain_scores_codex":[0.999539,0.00002628708,0.0001429209,0.00008492677,0.00007389356,0.0001330264],"domain_scores_gemma":[0.9993826,0.0003976967,0.00003231957,0.00008610338,0.00004496848,0.00005633849],"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.000002312291,0.000002821419,0.00007939279,0.00001055072,0.000009947929,1.454368e-7,0.0002799333,0.9589606,0.0002301536,0.00002135498,0.0006466542,0.03975615],"study_design_scores_gemma":[0.0001763871,0.00002831869,0.00002439561,0.00005613247,0.00001031278,0.000002997989,0.0000623053,0.9979731,0.0004968798,0.0002881297,0.0008046427,0.00007638238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0226923,0.0009056223,0.9751874,0.00001853372,0.0001539643,0.0001509155,0.000004923695,0.0001297736,0.000756631],"genre_scores_gemma":[0.3686149,0.0001103419,0.6308483,0.00001402902,0.0001629649,0.000031493,0.000008750154,0.00003497905,0.0001742776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3459226,"threshold_uncertainty_score":0.2856003,"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."}}