{"id":"W817481","doi":"","title":"Generating Random Dynamic Resource Scheduling Problems","year":2008,"lang":"en","type":"article","venue":"Viaţa medicală; revistă de informare profesională şi ştiinţifică a cadrelor medii sanitare","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dynamic priority scheduling; Computer science; Scheduling (production processes); Fair-share scheduling; Two-level scheduling; Earliest deadline first scheduling; Distributed computing; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Real-time computing; Mathematical optimization; Schedule; Operating system","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":["metaresearch","metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.02087363,0.001703324,0.002734026,0.001889412,0.003143924,0.000924826,0.004847705,0.001505987,0.004195992],"category_scores_gemma":[0.05063869,0.001323774,0.001290387,0.004027718,0.002090511,0.001684696,0.001532566,0.004620572,0.00122662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009293068,"about_ca_system_score_gemma":0.003511459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000896205,"about_ca_topic_score_gemma":0.00005398833,"domain_scores_codex":[0.9755471,0.002145231,0.00663149,0.002537505,0.009930267,0.003208393],"domain_scores_gemma":[0.9813248,0.008461682,0.002684998,0.002939018,0.002072331,0.002517186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.007604474,0.002868678,0.08187883,0.004347213,0.00274107,0.006147014,0.1387231,0.03835775,0.02581873,0.005326708,0.1709388,0.5152476],"study_design_scores_gemma":[0.01797432,0.001173081,0.006528507,0.007202189,0.0005518352,0.006283121,0.04603297,0.3377777,0.001089175,0.002603005,0.5667958,0.005988324],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8980935,0.009590159,0.06496342,0.009711814,0.002033666,0.005569462,0.0004088119,0.001440371,0.008188788],"genre_scores_gemma":[0.941404,0.00108713,0.04476687,0.005521817,0.001949965,0.0009357095,0.0007397868,0.0003343479,0.003260362],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5092593,"threshold_uncertainty_score":0.9997903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06270053567341327,"score_gpt":0.3395629118965534,"score_spread":0.2768623762231401,"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."}}