{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748752,0.001485149,0.002281538,0.0009389566,0.0008986553,0.002185014,0.002876176,0.002598969,0.00644481],"category_scores_gemma":[0.00443689,0.001201907,0.001056043,0.00249119,0.001304803,0.002766756,0.0013975,0.001778871,0.0008250618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002135943,"about_ca_system_score_gemma":0.00212851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006060417,"about_ca_topic_score_gemma":0.004129775,"domain_scores_codex":[0.9989538,0.0003372697,0.00003381213,0.0003719731,0.0001468742,0.0001562572],"domain_scores_gemma":[0.9983656,0.001099482,0.0001616956,0.00008228981,0.0001235366,0.0001674258],"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.0001644944,0.0000602753,0.0002616872,0.0001708394,0.00005516318,0.0001388999,0.0000472293,0.941229,0.0006086,0.03587458,0.003668447,0.01772069],"study_design_scores_gemma":[0.00004485115,0.00003211787,0.0001470583,0.000008121233,0.00001740915,0.0000480552,0.00003405097,0.9639907,0.0002194264,0.03395927,0.001487907,0.00001094697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0921265,0.00178693,0.8863603,0.002477323,0.0006223095,0.000195355,0.001409059,0.0002354753,0.01478679],"genre_scores_gemma":[0.7907493,0.002423007,0.1757256,0.0003386858,0.0007360424,0.0003909185,0.00141353,0.0002590221,0.02796397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00644481,"threshold_uncertainty_score":0.02156007,"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."}}