{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004972566,0.001648823,0.002190518,0.00152251,0.0008329378,0.001861462,0.004690371,0.001597926,0.004694237],"category_scores_gemma":[0.02281491,0.0009104624,0.001353508,0.002311882,0.001300131,0.00349889,0.001839275,0.003221444,0.0006382181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002902064,"about_ca_system_score_gemma":0.00363327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00741486,"about_ca_topic_score_gemma":0.007924855,"domain_scores_codex":[0.9971712,0.001337437,0.0001472636,0.0002874544,0.0006610692,0.0003955304],"domain_scores_gemma":[0.9809046,0.01461938,0.0008482955,0.001941344,0.001232391,0.0004539581],"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.0006512867,0.0003029165,0.001066738,0.000147437,0.00007405458,0.00006793888,0.00007246422,0.856769,0.001115935,0.02437135,0.003453613,0.1119072],"study_design_scores_gemma":[0.00002556593,0.00002497779,0.0000543953,0.000005293331,0.000007972607,0.000009571145,0.000004922093,0.9909416,0.000193269,0.008585424,0.0001439348,0.00000294045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02332019,0.0005725557,0.9710931,0.0004410768,0.0001288191,0.00009735409,0.0001286553,0.001147897,0.003070456],"genre_scores_gemma":[0.4372666,0.0003488479,0.557554,0.0002892798,0.0001594873,0.0003225507,0.0006081672,0.0003461665,0.003104884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00741486,"threshold_uncertainty_score":0.02629775,"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."}}