{"id":"W2951591595","doi":"10.1145/3323165.3323173","title":"Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; City University of Hong Kong; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Approximation algorithm; Schedule; Time complexity; Job shop scheduling; Constant (computer programming); Mathematical optimization; Running time; Algorithm; Parallel computing; Mathematics; Programming language; 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.0001113269,0.00005668025,0.00007044925,0.00007347442,0.00004431914,0.00006593877,0.0001992609,0.00001806026,0.00008357744],"category_scores_gemma":[0.00002379621,0.00004012533,0.00001492682,0.0002570337,0.00001430322,0.0004648957,0.0000432273,0.00004751829,0.00003183891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009898357,"about_ca_system_score_gemma":0.0000441448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002372801,"about_ca_topic_score_gemma":0.00001091447,"domain_scores_codex":[0.9993785,0.00002637532,0.0001250306,0.0001598442,0.0002153291,0.00009493587],"domain_scores_gemma":[0.9995049,0.00006531479,0.00005261729,0.0002531899,0.00009165766,0.00003228654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001822028,0.0001766544,0.01598581,0.00004237184,0.00001633931,3.638224e-7,0.0006397542,0.4510436,0.003234674,0.525469,0.0001393141,0.003233845],"study_design_scores_gemma":[0.0004178729,0.0001465623,0.0005350414,0.00001643838,6.924159e-7,5.689045e-7,0.00002276471,0.9959975,0.002247176,0.0003209532,0.000234772,0.00005963849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02543383,0.000003832311,0.9567494,0.0006315341,0.00004164486,0.0002707001,0.000001615555,0.00007935887,0.0167881],"genre_scores_gemma":[0.6744496,0.000001680621,0.3244671,0.0002034428,0.000006195484,0.000008349024,0.00001119639,0.00000346313,0.0008489378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6490158,"threshold_uncertainty_score":0.1636264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01533887018672189,"score_gpt":0.2356097280264979,"score_spread":0.220270857839776,"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."}}