{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008802569,0.0002937096,0.000236097,0.0001810236,0.0001685696,0.0001060946,0.0001919781,0.0001624691,0.000002965337],"category_scores_gemma":[0.00002342292,0.0002563741,0.00002221303,0.0001107975,0.0002606386,0.0001244865,0.00007220349,0.0004975215,0.000002427335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038432,"about_ca_system_score_gemma":0.00002892975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004920875,"about_ca_topic_score_gemma":0.00002075718,"domain_scores_codex":[0.9987875,0.000005052622,0.0001821445,0.0004807002,0.000232441,0.000312124],"domain_scores_gemma":[0.9993791,0.00015409,0.00006492604,0.0002706428,0.00004711777,0.00008412603],"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.000005565844,0.000006375461,0.000008695452,0.00002813554,0.000004510066,0.00002161233,0.0001232967,0.888451,0.00001955994,0.00005890085,0.000001761286,0.1112706],"study_design_scores_gemma":[0.0001817045,0.0001325833,0.00001679055,0.0005600587,0.000006396991,0.00002025501,1.153248e-7,0.9954643,0.0007918515,0.002356736,0.0001388068,0.0003303689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009497374,0.0008393245,0.9962844,0.0000233113,0.0002333645,0.0001677008,0.000001494617,0.0002000521,0.001300607],"genre_scores_gemma":[0.7689098,0.0002958125,0.230379,0.00009019745,0.0002092421,0.000003557168,0.000007552038,0.00005140877,0.00005338583],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7679601,"threshold_uncertainty_score":0.9999889,"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."}}