{"id":"W4390142484","doi":"10.1007/s00453-023-01198-w","title":"Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Preemption; Competitive analysis; Scheduling (production processes); Theory of computation; Multiprocessor scheduling; Algorithm; Multiprocessing; Online algorithm; Job shop scheduling; Computer science; Combinatorics; Approximation algorithm; Mathematics; Discrete mathematics; Parallel computing; Flow shop scheduling; Mathematical optimization; Upper and lower bounds; Schedule; 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.004152328,0.001451047,0.001890983,0.001245141,0.0008059146,0.001632098,0.002601279,0.001807661,0.002896369],"category_scores_gemma":[0.01662892,0.0007372079,0.00125218,0.002053526,0.001616754,0.002236777,0.001485719,0.002754433,0.0003885016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002632933,"about_ca_system_score_gemma":0.003526216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006713049,"about_ca_topic_score_gemma":0.005970202,"domain_scores_codex":[0.9982145,0.0009341817,0.00006636407,0.0002035256,0.0003406099,0.0002408372],"domain_scores_gemma":[0.989608,0.008411783,0.0005413254,0.0005762511,0.000545079,0.0003176524],"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.0002357608,0.0001132789,0.0004885753,0.0001167552,0.00005363972,0.00002924728,0.00004972117,0.9316962,0.0004856104,0.02564542,0.002890436,0.03819532],"study_design_scores_gemma":[0.00001975949,0.00001671405,0.00004432114,0.000008385001,0.000007365007,0.000006371154,0.000005881563,0.9840402,0.0001331931,0.01554324,0.0001718248,0.00000279401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01665394,0.0006393141,0.9786243,0.0005632573,0.0001047426,0.0000811701,0.0001126658,0.0005128646,0.002707726],"genre_scores_gemma":[0.510458,0.0006723701,0.4832324,0.0003558159,0.0002100019,0.0004334863,0.0005859278,0.0004181898,0.003633807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006713049,"threshold_uncertainty_score":0.02195984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0296987392796981,"score_gpt":0.2475159521126923,"score_spread":0.2178172128329942,"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."}}