{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003607833,0.00199644,0.002361127,0.001536307,0.0007798058,0.001674233,0.004786117,0.00159737,0.007353268],"category_scores_gemma":[0.01653874,0.0009743278,0.001707675,0.003322284,0.001681239,0.003986389,0.002243892,0.005500276,0.001351343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002608676,"about_ca_system_score_gemma":0.002038678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004609596,"about_ca_topic_score_gemma":0.004983873,"domain_scores_codex":[0.9969907,0.001180703,0.0001590091,0.0003517891,0.000971495,0.0003462704],"domain_scores_gemma":[0.989319,0.006964874,0.0004317456,0.002184934,0.0008580212,0.0002413893],"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.0007061007,0.0003062465,0.0006752422,0.0002661414,0.0001072125,0.00007542917,0.00009250081,0.5217766,0.002647141,0.1029565,0.01243791,0.357953],"study_design_scores_gemma":[0.00004967331,0.00003878665,0.0001079485,0.00001655186,0.00001934955,0.00002667731,0.000009030357,0.9422116,0.0006598392,0.055464,0.001388493,0.000007884369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005646191,0.0006804147,0.9875738,0.0002671983,0.0001955437,0.00005682039,0.00009578192,0.0012788,0.004205458],"genre_scores_gemma":[0.1484763,0.0004857193,0.8440393,0.0002486287,0.0002622477,0.0002574649,0.0005160116,0.0005399602,0.005174507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007353268,"threshold_uncertainty_score":0.02459913,"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."}}