{"id":"W2084812016","doi":"10.1007/s10951-014-0387-8","title":"On-line preemptive machine scheduling with $$\\ell _p$$ ℓ p norm on two uniform machines","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preemption; Unavailability; Scheduling (production processes); Job shop scheduling; Computer science; Competitive analysis; Mathematical optimization; Upper and lower bounds; Mathematics; Combinatorics; Algorithm","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357525,0.0004215841,0.0005491425,0.0004826102,0.0001699516,0.0001247733,0.0003717764,0.0001301521,0.00008415478],"category_scores_gemma":[0.0002811518,0.0003167563,0.0001719205,0.0004336804,0.00006096438,0.0003286791,0.0000295542,0.001100144,0.00006199807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001386564,"about_ca_system_score_gemma":0.00005609681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007441667,"about_ca_topic_score_gemma":0.000009283975,"domain_scores_codex":[0.9978837,0.00005531998,0.0007491559,0.0002452297,0.0006421883,0.0004243821],"domain_scores_gemma":[0.9983352,0.0003535973,0.0003687789,0.0003102894,0.0003361651,0.0002960096],"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.0002237454,0.00009322842,0.0003729034,0.00004000848,0.0001461737,0.00002524936,0.0002416754,0.9894463,0.0003018719,0.00115195,0.00001351591,0.007943384],"study_design_scores_gemma":[0.002749187,0.0009932901,0.0001355448,0.0006236965,0.00007786122,0.000141003,0.0001144901,0.9896893,0.004423666,0.0005132444,0.0001314773,0.0004072547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5294378,0.0003342044,0.4648752,0.0003194863,0.0008584602,0.0001344649,0.000007314013,0.0001903063,0.003842785],"genre_scores_gemma":[0.7197867,0.00007313467,0.2789491,0.000243373,0.0007796396,0.000002773299,0.000007420096,0.00008775314,0.00007015574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1903489,"threshold_uncertainty_score":0.9999285,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01192599861620092,"score_gpt":0.2421001829961974,"score_spread":0.2301741843799965,"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."}}