{"id":"W2954538625","doi":"10.23977/acss.2018.21002","title":"RGV dynamic scheduling optimization model based on greedy algorithm","year":2018,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Maximization; Greedy algorithm; Minification; Dynamic priority scheduling; Mathematical optimization; Task (project management); Process (computing); Distributed computing; Algorithm; Engineering; Schedule; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687053,0.0008312422,0.00117842,0.0006395153,0.0005761895,0.001322767,0.001432689,0.001109881,0.002744969],"category_scores_gemma":[0.0009829992,0.0005158015,0.0007052459,0.0009395477,0.0007413406,0.000967543,0.0008520221,0.0008416168,0.0005101984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001478968,"about_ca_system_score_gemma":0.002075395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01502262,"about_ca_topic_score_gemma":0.006974355,"domain_scores_codex":[0.9995021,0.0001309164,0.0000185042,0.0001094087,0.0001255638,0.0001135405],"domain_scores_gemma":[0.9997591,0.0001026228,0.00003984738,0.00001566706,0.00006236881,0.00002045167],"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.00001720618,0.000008165342,0.0001103733,0.00002027671,0.00001005382,0.00002059593,0.00001494869,0.9852878,0.0002745665,0.008246117,0.0005933018,0.005396612],"study_design_scores_gemma":[0.000004183613,0.000007878117,0.00002313051,0.000001881276,0.000002067341,0.000004690611,0.000002855557,0.9975134,0.00004279186,0.002130856,0.0002640996,0.000002204109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01570147,0.000515383,0.9716788,0.0004171196,0.00006715566,0.00008001131,0.000100221,0.0003246298,0.01111518],"genre_scores_gemma":[0.8310026,0.001007286,0.1512876,0.0002471691,0.00007938856,0.00057322,0.0003067035,0.0001516674,0.01534438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01502262,"threshold_uncertainty_score":0.02987039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009956661245621876,"score_gpt":0.2430143163532612,"score_spread":0.2330576551076393,"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."}}