{"id":"W2949433202","doi":"10.48550/arxiv.1404.7325","title":"Tight Bounds for Restricted Grid Scheduling","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Syddansk Universitet; University of Waterloo; University of Toronto; Danmarks Frie Forskningsfond; Villum Fonden","keywords":"Bin; Bin packing problem; Grid; Upper and lower bounds; Competitive analysis; Matching (statistics); Online algorithm; Scheduling (production processes); Integer (computer science); Computer science; Mathematics; Mathematical optimization; Combinatorics; Algorithm; Statistics","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.004701368,0.00243366,0.002968874,0.002863276,0.001689892,0.005197678,0.003993926,0.001940827,0.01634966],"category_scores_gemma":[0.02898352,0.001290242,0.001445882,0.005704173,0.002591422,0.007094769,0.004307211,0.005050882,0.003013339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004271425,"about_ca_system_score_gemma":0.002696043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007566753,"about_ca_topic_score_gemma":0.005997955,"domain_scores_codex":[0.9951118,0.00137651,0.0001721632,0.0006987847,0.001416011,0.001224814],"domain_scores_gemma":[0.9822356,0.01236629,0.001018669,0.00247613,0.001066273,0.0008370322],"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.001034498,0.0003155769,0.001450848,0.0008667741,0.0001763346,0.0002180493,0.000278218,0.550307,0.003143635,0.3513659,0.02816269,0.06268042],"study_design_scores_gemma":[0.00008770288,0.00008473858,0.0005176783,0.0001300029,0.00005302026,0.00008880789,0.0001099586,0.5472324,0.0007909117,0.4419377,0.00893951,0.00002744549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0755634,0.01737455,0.7924715,0.006826587,0.00105758,0.0002296228,0.002070841,0.003044935,0.101361],"genre_scores_gemma":[0.8211547,0.009486469,0.1472366,0.001803613,0.001098351,0.0005666285,0.002671964,0.001421341,0.01456022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01634966,"threshold_uncertainty_score":0.05469513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08947936903725882,"score_gpt":0.2088021905716253,"score_spread":0.1193228215343665,"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."}}