{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002140816,0.0001814186,0.0002254986,0.0001764429,0.00007763132,0.0001001341,0.0001134233,0.00008469389,0.000006645951],"category_scores_gemma":[0.000005774145,0.0001758421,0.000027038,0.0002273639,0.00003987564,0.0002476058,0.0000168364,0.0001134574,0.000007051934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004347596,"about_ca_system_score_gemma":0.00001227695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002928875,"about_ca_topic_score_gemma":0.000002321972,"domain_scores_codex":[0.9989964,0.00003753998,0.0003103426,0.0002652527,0.0001715441,0.0002189335],"domain_scores_gemma":[0.9995549,0.00007405801,0.00004903672,0.0001734796,0.00007933444,0.00006917628],"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.000003674106,0.00001383897,0.0000385228,0.00004346444,0.000005502518,0.00000221555,0.00007122112,0.9657255,0.000006079325,0.00004175731,0.000005307565,0.03404286],"study_design_scores_gemma":[0.0004316514,0.00008312301,0.000005224724,0.0002375153,0.000003958468,0.000003822514,0.00001981597,0.9988925,0.00001938421,0.00004985,0.00004123633,0.0002119542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001160303,0.001974717,0.9950215,0.00001607878,0.001115333,0.0001686847,0.00000783844,0.0002103052,0.0003253063],"genre_scores_gemma":[0.3379017,0.000228941,0.6614766,0.00007726673,0.000239009,0.00001915521,0.0000136146,0.00002954439,0.00001412453],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3367414,"threshold_uncertainty_score":0.7170631,"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."}}