{"id":"W4280645929","doi":"10.1007/s10878-022-00865-y","title":"Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiprocessor scheduling; Theory of computation; Computer science; Competitive analysis; Multiprocessing; Job shop scheduling; Upper and lower bounds; Scheduling (production processes); Algorithm; Approximation algorithm; Online algorithm; Parallel computing; Flow shop scheduling; Partition (number theory); Mathematical optimization; Mathematics; Combinatorics; Schedule","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":[],"consensus_categories":[],"category_scores_codex":[0.0006033804,0.0001855758,0.0002947475,0.0002540823,0.0003050261,0.00008988001,0.0002132501,0.00006899342,0.00001740879],"category_scores_gemma":[0.0002980873,0.0001796233,0.00007712557,0.0006368405,0.00001988347,0.0004532959,0.00002921812,0.0003312604,3.046075e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002222035,"about_ca_system_score_gemma":0.0001503229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001787371,"about_ca_topic_score_gemma":5.86741e-8,"domain_scores_codex":[0.9986461,0.00003990495,0.0005630085,0.0001463003,0.0003873472,0.0002173594],"domain_scores_gemma":[0.9982048,0.0001929424,0.0004683516,0.0001118966,0.0009302725,0.00009178805],"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.0001795609,0.00008065857,0.00003475177,0.00004724706,0.00006898586,0.000002065839,0.0003797635,0.996914,0.0004070822,0.00009008878,0.00002060984,0.001775168],"study_design_scores_gemma":[0.004034427,0.0007195728,0.000007714396,0.00004325222,0.00006986401,0.00004010669,0.0004893015,0.9921182,0.001960333,0.0002615022,0.00003363272,0.0002221045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006207561,0.00007651883,0.9902265,0.00004498706,0.002748369,0.0004397716,0.00001149129,0.000108624,0.0001361925],"genre_scores_gemma":[0.2051284,0.000006579053,0.7942122,0.00001728341,0.0004643068,0.00007026598,0.00003019093,0.000060035,0.00001072817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1989209,"threshold_uncertainty_score":0.7324825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01482628996129999,"score_gpt":0.2346524241045523,"score_spread":0.2198261341432523,"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."}}