{"id":"W151615172","doi":"","title":"Proactive algorithms for scheduling with probabilistic durations","year":2005,"lang":"en","type":"article","venue":"Cork Open Research Archive (University College Cork, Ireland)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Science Foundation Ireland","keywords":"Computer science; Probabilistic logic; Probabilistic analysis of algorithms; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Fair-share scheduling; Flow shop scheduling; Job shop scheduling; Algorithm; Mathematical optimization; Quality of service; Artificial intelligence; Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":false,"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.006645735,0.001202401,0.0009831599,0.001718444,0.001023672,0.001976217,0.003117762,0.00177667,0.002975977],"category_scores_gemma":[0.02589552,0.000899545,0.001204,0.00245489,0.001497186,0.003884428,0.001869837,0.002883722,0.0007521441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001917014,"about_ca_system_score_gemma":0.002816088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002273437,"about_ca_topic_score_gemma":0.002705833,"domain_scores_codex":[0.9960456,0.001262932,0.00022869,0.0006089938,0.001614744,0.0002389708],"domain_scores_gemma":[0.9769108,0.01745084,0.002088548,0.002273664,0.0009740283,0.0003021082],"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.0001623938,0.0001194017,0.001426834,0.0002778321,0.00008899531,0.00004273227,0.0001809282,0.7478979,0.002982689,0.1424503,0.002761535,0.1016084],"study_design_scores_gemma":[0.000047382,0.00009273858,0.000328239,0.00002369268,0.00002473967,0.00007014925,0.00002430358,0.924056,0.001102269,0.07122112,0.002984666,0.00002474898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005356146,0.0003340062,0.9921108,0.0001713971,0.0000331655,0.00006818547,0.00005998684,0.0003224952,0.001543896],"genre_scores_gemma":[0.2775871,0.0007784783,0.7175685,0.0002889854,0.0001710272,0.000647046,0.0003332387,0.0001985711,0.002426947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006645735,"threshold_uncertainty_score":0.03514647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05926483646504532,"score_gpt":0.2934855684034336,"score_spread":0.2342207319383883,"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."}}