{"id":"W2016619874","doi":"10.1016/j.ejor.2004.06.016","title":"The single-node dynamic service scheduling and dispatching problem","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Operations research; Mathematical optimization; Distributed computing; Computer network; Quality of service; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.006105466,0.00008468988,0.00009003787,0.0001199495,0.0004874785,0.000395008,0.0002792086,0.0000164094,0.000008341277],"category_scores_gemma":[0.0005152442,0.00006207406,0.00002654516,0.0003055762,0.00006100195,0.0002750109,0.00008152606,0.00063667,0.00001917316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001357238,"about_ca_system_score_gemma":0.00009661118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002106925,"about_ca_topic_score_gemma":0.000006545173,"domain_scores_codex":[0.9981235,0.0005970298,0.0003787667,0.00009264243,0.0005705245,0.0002375532],"domain_scores_gemma":[0.9987526,0.0003556367,0.00004838585,0.0001100935,0.0006219678,0.0001113422],"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.00001272704,0.00001352542,0.00006713595,0.00002038633,0.00002319593,0.00002680022,0.00057451,0.9723923,0.01641094,0.0009568561,0.00002409553,0.009477533],"study_design_scores_gemma":[0.00277505,0.0003902497,0.01374644,0.000860877,0.00002168232,0.0008351501,0.001338399,0.9672743,0.003134908,0.002352068,0.006808268,0.0004625751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6490793,0.001451972,0.3353002,0.008045777,0.0002004883,0.0001695046,0.000002583441,0.00004898543,0.005701281],"genre_scores_gemma":[0.8050882,0.0001842189,0.194435,0.00005862808,0.0001418129,8.595895e-7,0.000001391722,0.00003810953,0.0000517356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.156009,"threshold_uncertainty_score":0.3809071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0517134440202458,"score_gpt":0.3366651362674725,"score_spread":0.2849516922472267,"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."}}