{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005430617,0.002850582,0.003622193,0.002520951,0.001878887,0.005146984,0.004956706,0.002000951,0.018672],"category_scores_gemma":[0.03435088,0.001400124,0.001506939,0.006175623,0.002674803,0.008255447,0.004725942,0.004917869,0.003004817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00483082,"about_ca_system_score_gemma":0.003748899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00888878,"about_ca_topic_score_gemma":0.007153429,"domain_scores_codex":[0.9946876,0.001446266,0.0001831367,0.0008123431,0.001410896,0.001459869],"domain_scores_gemma":[0.9775988,0.01550582,0.001405733,0.002920789,0.001285649,0.001283298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001426307,0.0004041402,0.001511651,0.001056451,0.0001774381,0.0002402581,0.000286071,0.6272854,0.003251821,0.2718713,0.02871066,0.06377839],"study_design_scores_gemma":[0.0001068186,0.0001414755,0.0004654084,0.0001138287,0.00005824444,0.0001068915,0.0001153549,0.6834593,0.0007425522,0.3075137,0.007145636,0.00003089606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07636808,0.01123413,0.8250552,0.005529604,0.001131726,0.0003343105,0.001980914,0.003388675,0.07497738],"genre_scores_gemma":[0.8041944,0.006445646,0.1677045,0.001790052,0.000940519,0.0006342412,0.002389945,0.001597612,0.01430301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.018672,"threshold_uncertainty_score":0.062464,"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."}}