{"id":"W4386773691","doi":"10.5267/j.ijiec.2023.6.003","title":"A dynamic scheduling method with Conv-Dueling and generalized representation based on reinforcement learning","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Key Research and Development Program of China","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Reinforcement learning; Fair-share scheduling; Mathematical optimization; Artificial intelligence; 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.0003628083,0.0001344967,0.0001728635,0.0006893592,0.00005678543,0.0001176945,0.0001276262,0.00006988248,0.00001218842],"category_scores_gemma":[0.0003039192,0.0001301823,0.00005512446,0.0004225739,0.00001154827,0.000150138,0.00001569657,0.0003843943,0.000004048018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001099673,"about_ca_system_score_gemma":0.0000543014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000422318,"about_ca_topic_score_gemma":3.304805e-7,"domain_scores_codex":[0.9988969,0.00003320184,0.00041717,0.0001085964,0.0004089898,0.000135139],"domain_scores_gemma":[0.9990824,0.0003544327,0.0001358478,0.00005826412,0.0002861049,0.00008297659],"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.00004086078,0.000006808791,0.0001211665,0.000005153445,0.0001334094,0.00002564089,0.0001467836,0.9940252,0.0002757772,0.0001142686,0.00002013264,0.005084768],"study_design_scores_gemma":[0.001873475,0.00008483168,0.0001243996,0.0002206747,0.00002610807,0.00003952334,0.0001187046,0.9968775,0.0003874967,0.00001661524,0.0001010865,0.0001296182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08174063,0.00002341353,0.916477,0.0003644213,0.001047762,0.00008214998,0.000002467976,0.0002127189,0.00004946079],"genre_scores_gemma":[0.7708068,0.00003176562,0.2287891,0.00002967413,0.0002375312,0.000005985715,0.00004657489,0.00003372838,0.00001879976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6890662,"threshold_uncertainty_score":0.530868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02677162049098065,"score_gpt":0.295867984628311,"score_spread":0.2690963641373303,"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."}}