{"id":"W1580125762","doi":"10.1007/978-3-540-69733-6_65","title":"A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Job shop scheduling; Upper and lower bounds; Norm (philosophy); Scheduling (production processes); Computer science; Regular polygon; Mathematical optimization; Competitive analysis; Combinatorics; Algorithm; Discrete mathematics; Mathematics","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"],"consensus_categories":[],"category_scores_codex":[0.0002244755,0.0003744703,0.000283008,0.0002442312,0.0002715462,0.0001447624,0.0006233298,0.0001701178,0.00001890507],"category_scores_gemma":[0.00004946491,0.0002459818,0.00007605952,0.0002404185,0.0004289602,0.0000973319,0.00007484484,0.0006131368,0.00001367383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000141106,"about_ca_system_score_gemma":0.0001307414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004576463,"about_ca_topic_score_gemma":0.00003730333,"domain_scores_codex":[0.9984719,0.000004385593,0.0002338064,0.000512035,0.0004244043,0.000353439],"domain_scores_gemma":[0.9986547,0.000554024,0.00007151107,0.0004888005,0.0001559172,0.00007511305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002203798,0.000008638437,0.000003293373,0.00001582417,0.0000233246,0.00001116879,0.0002737574,0.9451832,0.000002275297,0.0001342292,0.000008137183,0.05431417],"study_design_scores_gemma":[0.0003513379,0.0002379375,0.000008086339,0.0002392444,0.00001442956,0.00003516599,2.262242e-7,0.9969341,0.0002614776,0.0008712684,0.000705824,0.0003409101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001041045,0.0009540523,0.9957516,0.0002451681,0.001183824,0.000462466,0.00001683022,0.0001649505,0.001116993],"genre_scores_gemma":[0.08042162,0.0002597265,0.9166088,0.0009726867,0.001079832,0.00003993024,0.00001949552,0.0001228211,0.0004751585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08031752,"threshold_uncertainty_score":0.9999992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01794009135289408,"score_gpt":0.233990085082691,"score_spread":0.2160499937297969,"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."}}