{"id":"W7132860486","doi":"","title":"Online Non-preemptive Resource Constrained Scheduling","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Queue; Scheduling (production processes); Workload; Flow shop scheduling; Job scheduler; Job queue; Rate-monotonic scheduling","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","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007972045,0.0008117775,0.0007532875,0.0007061146,0.0004752451,0.001280856,0.001659598,0.00065192,0.0008213324],"category_scores_gemma":[0.0002949361,0.0008497019,0.0003667071,0.001906675,0.0002430591,0.0004117737,0.0004898324,0.001898432,0.001328328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001860467,"about_ca_system_score_gemma":0.001435394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001753707,"about_ca_topic_score_gemma":0.000128389,"domain_scores_codex":[0.9950178,0.0002618269,0.0008661614,0.001729861,0.001121991,0.001002394],"domain_scores_gemma":[0.9969466,0.0003064258,0.0004315156,0.00109033,0.0006861928,0.0005388748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004428027,0.002033262,0.00005583713,0.004693137,0.001463372,0.0008936215,0.5924782,0.2259914,0.008687926,0.05811524,0.01187585,0.09326933],"study_design_scores_gemma":[0.0007675621,0.0003237927,0.00007891181,0.002087764,0.0001028145,0.00002457869,0.02853711,0.9547491,0.0008822645,0.0005588155,0.01091896,0.0009683178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05194061,0.004518429,0.7584693,0.01345045,0.005903122,0.003742526,0.0001253007,0.001350888,0.1604994],"genre_scores_gemma":[0.2755083,0.001215437,0.2919951,0.00162308,0.001432029,0.0001614638,0.003312336,0.0003804488,0.4243719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7287577,"threshold_uncertainty_score":0.9997559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0323710719327489,"score_gpt":0.3608993403813375,"score_spread":0.3285282684485886,"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."}}