{"id":"W4214905240","doi":"10.1007/978-3-030-97099-4_5","title":"Improved Approximation Algorithms for Multiprocessor Scheduling with Testing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Multiprocessor scheduling; Multiprocessing; Job shop scheduling; Competitive analysis; Scheduling (production processes); Upper and lower bounds; Parallel computing; Flow shop scheduling; sort; Algorithm; Partition (number theory); Online algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Schedule; Combinatorics; Operating system","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004341888,0.0003700205,0.00032065,0.0004240866,0.0002777504,0.0001945862,0.0005286065,0.0001623154,0.00001898562],"category_scores_gemma":[0.0001505865,0.0003476999,0.00005056116,0.0004717386,0.0001478012,0.0002522608,0.0001115108,0.0005690277,0.000001914413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002480965,"about_ca_system_score_gemma":0.0002021312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005387939,"about_ca_topic_score_gemma":0.000006976455,"domain_scores_codex":[0.9981778,0.000005741951,0.0003348815,0.0006662051,0.0004042883,0.0004110864],"domain_scores_gemma":[0.9988193,0.0003780124,0.0001310571,0.0003355533,0.0002511052,0.00008497288],"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.000004268342,0.000004942788,0.000004252342,0.00008244286,0.000007899457,0.000002374232,0.0001705577,0.7483236,0.0000880891,0.00007885083,2.851102e-7,0.2512325],"study_design_scores_gemma":[0.0004218702,0.0001160322,0.000002636672,0.0001776963,0.00001375278,0.00002035987,9.267544e-7,0.9959198,0.00115226,0.001618109,0.00009449648,0.0004621024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008050058,0.0002532947,0.9972696,0.00004914847,0.0008033642,0.000582417,0.00001543018,0.0004135238,0.0005326738],"genre_scores_gemma":[0.009031582,0.000008993724,0.990201,0.0001145657,0.000380128,0.00007922018,0.00003701618,0.00009079627,0.0000567047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2507704,"threshold_uncertainty_score":0.9998975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02204191419564522,"score_gpt":0.235088582724355,"score_spread":0.2130466685287098,"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."}}