{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006775995,0.0002402688,0.0003086053,0.0004507485,0.001167487,0.0001723688,0.0009359865,0.0001086097,0.0001097168],"category_scores_gemma":[0.000286925,0.0002469032,0.00007699383,0.001050279,0.0002878512,0.0006626928,0.0003010473,0.000625529,0.0001118447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003659026,"about_ca_system_score_gemma":0.000403859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004621187,"about_ca_topic_score_gemma":0.0005883563,"domain_scores_codex":[0.9979513,0.0001957124,0.0001886889,0.0005322132,0.0004425815,0.0006894465],"domain_scores_gemma":[0.9976375,0.0007976649,0.00005073899,0.0004251765,0.0007370022,0.0003519382],"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.002799661,0.0006555099,0.0004887859,0.0002876638,0.0008221279,0.0001660166,0.005377522,0.8749328,0.0003053209,0.06879631,0.02332822,0.02204006],"study_design_scores_gemma":[0.002760908,0.0003480985,0.0004245096,0.0001278088,0.00004257664,0.00001453415,0.003545109,0.9745299,0.00008993691,0.0006921546,0.017037,0.000387423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0164516,0.0001447304,0.9473912,0.001421547,0.0002399473,0.005319354,0.001208632,0.000402797,0.02742023],"genre_scores_gemma":[0.1953506,0.0001432515,0.7947838,0.00003945929,0.0003718735,0.0001680741,0.0003067376,0.0001006648,0.008735562],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.178899,"threshold_uncertainty_score":0.9999983,"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."}}