{"id":"W2805215296","doi":"10.1142/s0129054119500102","title":"Tight Bounds for Restricted Grid Scheduling","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Villum Fonden; Velux Fonden; Natur og Univers, Det Frie Forskningsråd","keywords":"Computer science; Grid; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0009004794,0.00008277201,0.0001532883,0.0008061895,0.0001168457,0.0005547534,0.002963441,0.00002679444,0.00002688775],"category_scores_gemma":[0.0001890765,0.00007360295,0.0001091128,0.0007869072,0.0001667839,0.002420223,0.0002825271,0.0001142994,0.00001432982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039819,"about_ca_system_score_gemma":0.0008654241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000344536,"about_ca_topic_score_gemma":6.27686e-7,"domain_scores_codex":[0.9979645,0.00002942674,0.0005660776,0.0002083117,0.001051357,0.0001803002],"domain_scores_gemma":[0.9951502,0.0002187431,0.0005318873,0.0002796643,0.003717893,0.0001015888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007936201,0.0005040736,0.003497326,0.00003354989,0.0001872164,0.00001017129,0.001413501,0.2587599,0.01813031,0.6063657,0.001747614,0.1092713],"study_design_scores_gemma":[0.001111391,0.000382954,0.003636894,0.0001011372,0.00000473209,0.00008817467,0.00001218806,0.9733332,0.00311271,0.007807722,0.01027004,0.0001388465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02820827,0.00002130067,0.9641526,0.00259278,0.0043848,0.000144404,0.00000337977,0.00001813673,0.0004743115],"genre_scores_gemma":[0.4428553,0.00001641753,0.556688,0.0001550203,0.0002157098,0.000001701217,0.000002376794,0.000003393947,0.00006213728],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7145733,"threshold_uncertainty_score":0.550686,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02141171219988953,"score_gpt":0.3211172518151988,"score_spread":0.2997055396153093,"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."}}