{"id":"W2143443880","doi":"10.1007/978-3-540-92182-0_70","title":"Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Tree (set theory); Path (computing); Distributed computing; Real-time computing; Mathematical optimization; Computer network; Mathematics; Combinatorics","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.001626949,0.001814726,0.002698323,0.001211296,0.0008322781,0.002161473,0.002725412,0.002180512,0.007960248],"category_scores_gemma":[0.00320689,0.001534199,0.001618735,0.003722621,0.001077418,0.00297461,0.001072262,0.001686023,0.0006518153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955265,"about_ca_system_score_gemma":0.001659703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005795337,"about_ca_topic_score_gemma":0.004923335,"domain_scores_codex":[0.9993547,0.0001808093,0.00003176461,0.000165941,0.0001188884,0.0001478372],"domain_scores_gemma":[0.9977272,0.001659431,0.0002342224,0.00008347825,0.0001137438,0.0001820393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001633712,0.0000699583,0.0001692856,0.0002222234,0.00004738657,0.000103384,0.00003924358,0.9613135,0.001341845,0.01729943,0.002415187,0.01681523],"study_design_scores_gemma":[0.00004443165,0.00009939285,0.0001747719,0.00001821214,0.00002344364,0.00004963715,0.00003442218,0.9608439,0.0007007811,0.03677652,0.001221127,0.00001341761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1762044,0.002458531,0.7900298,0.001289852,0.0003976639,0.0005753714,0.001628781,0.0004604638,0.02695499],"genre_scores_gemma":[0.6916808,0.003198668,0.2606067,0.0003141408,0.0004751488,0.0006797513,0.001429647,0.0005827466,0.0410323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007960248,"threshold_uncertainty_score":0.02662975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00946704179049813,"score_gpt":0.1861730336214204,"score_spread":0.1767059918309223,"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."}}