{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004200132,0.0002686723,0.0002581778,0.0001925056,0.0003432814,0.0001487147,0.0002426184,0.00009998721,0.00001730229],"category_scores_gemma":[0.0003129567,0.0002099635,0.00006355103,0.001306519,0.00004432591,0.0001653001,0.00004454208,0.0001808331,0.0003253339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006617173,"about_ca_system_score_gemma":0.00003446664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008935883,"about_ca_topic_score_gemma":6.254764e-7,"domain_scores_codex":[0.9984678,0.00002575209,0.0003375208,0.0003541575,0.0003212236,0.0004935604],"domain_scores_gemma":[0.9987522,0.0004958948,0.00006169151,0.0002792555,0.0002766603,0.0001343005],"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.00002159583,0.00001558764,0.00003443732,0.00005922358,0.00005701569,0.000002356783,0.000475611,0.9571131,0.001920487,0.00003304034,0.0003656987,0.03990179],"study_design_scores_gemma":[0.0007402888,0.00006423189,0.0009944361,0.00007090464,0.00003513485,0.00002128414,0.0003000611,0.9949645,0.002254286,0.00006237089,0.0001636146,0.0003289168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03936511,0.00004039796,0.9564825,0.0006589147,0.0003591951,0.0009208748,0.00006171971,0.00176638,0.0003449068],"genre_scores_gemma":[0.02656969,0.000003184786,0.9714753,0.0001155375,0.0005577622,0.0005142456,0.0001751759,0.0001219674,0.000467119],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03957288,"threshold_uncertainty_score":0.8562065,"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."}}