{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00309167,0.001526331,0.001843547,0.0009959115,0.0006305694,0.001496389,0.002447548,0.00173415,0.00476258],"category_scores_gemma":[0.01121411,0.001236614,0.001859386,0.002981624,0.00152022,0.002984852,0.001958015,0.004087194,0.0009275666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529655,"about_ca_system_score_gemma":0.001537861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003620781,"about_ca_topic_score_gemma":0.002085181,"domain_scores_codex":[0.9975328,0.001001583,0.00009317698,0.0005004029,0.0005115828,0.0003603686],"domain_scores_gemma":[0.9959714,0.002495329,0.0005236443,0.0005567404,0.0002380223,0.0002148499],"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.0002972027,0.00009780229,0.0005799589,0.0002473736,0.00006894763,0.00008314879,0.00007252173,0.8821936,0.001606724,0.06150031,0.006867762,0.04638462],"study_design_scores_gemma":[0.00004053777,0.00006791973,0.000248186,0.00001944523,0.00001347944,0.00004776412,0.00001040772,0.9573689,0.0004498696,0.03872057,0.003000544,0.00001241183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02050432,0.003388842,0.9660591,0.00154978,0.0003335843,0.0001027406,0.0002166518,0.0007319727,0.007112957],"genre_scores_gemma":[0.5635977,0.00470741,0.4193754,0.0006069519,0.001071543,0.0003567826,0.0007618181,0.0004198274,0.009102626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00476258,"threshold_uncertainty_score":0.018354,"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."}}