{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007739301,0.004801041,0.004081141,0.002785409,0.001771346,0.006069402,0.007760786,0.004144714,0.01123918],"category_scores_gemma":[0.02788532,0.001301386,0.002031053,0.003416024,0.003141684,0.007071596,0.005051534,0.01192748,0.002615792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004960249,"about_ca_system_score_gemma":0.004261548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002510933,"about_ca_topic_score_gemma":0.0025749,"domain_scores_codex":[0.9929147,0.002400822,0.000232703,0.0007792535,0.002559293,0.001113305],"domain_scores_gemma":[0.9757001,0.01723081,0.0009715425,0.001875057,0.00278476,0.001437687],"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.001558948,0.0008028339,0.0006989544,0.001142648,0.0002235787,0.0002392442,0.0003525639,0.5033678,0.01063058,0.2882888,0.0369002,0.1557938],"study_design_scores_gemma":[0.00003162701,0.0001683641,0.0002250772,0.0000924062,0.00004289201,0.00008335143,0.00004049804,0.9140224,0.001750272,0.08029907,0.003216204,0.00002789201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01121356,0.004430472,0.9527542,0.002575339,0.001020636,0.0001740305,0.0004501472,0.0009224379,0.02645932],"genre_scores_gemma":[0.3707432,0.006225873,0.5748988,0.002623145,0.003210796,0.001566734,0.001696745,0.002189618,0.03684498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01123918,"threshold_uncertainty_score":0.04092985,"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."}}