{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982166,0.001269088,0.001791258,0.0006514736,0.0007427354,0.001412036,0.002442778,0.001113457,0.004269522],"category_scores_gemma":[0.00698825,0.0005229775,0.0005394146,0.001292714,0.0009870924,0.002142105,0.002278547,0.001734712,0.0004978409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114532,"about_ca_system_score_gemma":0.001174441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001993696,"about_ca_topic_score_gemma":0.002136849,"domain_scores_codex":[0.9979969,0.00105166,0.00008768353,0.0002483396,0.0003544494,0.0002610133],"domain_scores_gemma":[0.9964944,0.001846802,0.0002603427,0.0005550979,0.0005071142,0.0003362321],"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.001945764,0.0004089274,0.0006437983,0.0002982825,0.000062701,0.0002709284,0.0001278903,0.8414466,0.007767653,0.05392289,0.006205064,0.08689962],"study_design_scores_gemma":[0.00002141613,0.00007827578,0.00008585901,0.00000414328,0.000003765832,0.0000162847,0.000008295983,0.9881371,0.0007623157,0.01054533,0.0003328123,0.000004414931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05198054,0.0002982802,0.9397286,0.0004414387,0.0001688119,0.0001093473,0.0001518964,0.0006120186,0.006509045],"genre_scores_gemma":[0.6547017,0.0002229462,0.3373683,0.0002216479,0.000157254,0.0002305899,0.0003204885,0.0002844736,0.006492585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004269522,"threshold_uncertainty_score":0.01428294,"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."}}