{"id":"W1903284337","doi":"10.1109/sffcs.1999.814574","title":"Approximation schemes for minimizing average weighted completion time with release dates","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":207,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Preemption; Approximation algorithm; Polynomial-time approximation scheme; Scheduling (production processes); Time complexity; Job shop scheduling; Constant (computer programming); Computer science; Running time; Processor scheduling; Execution time; Mathematical optimization; Mathematics; Binary logarithm; Combinatorics; Algorithm; Parallel computing; Schedule","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.003885357,0.001185988,0.001295094,0.0007905339,0.0006779917,0.001357156,0.002778963,0.001203988,0.001808849],"category_scores_gemma":[0.0127078,0.0006473233,0.0009116751,0.00158313,0.001068508,0.002349115,0.001412888,0.001845109,0.0004722331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001555911,"about_ca_system_score_gemma":0.001292721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862492,"about_ca_topic_score_gemma":0.002374626,"domain_scores_codex":[0.9977657,0.000766282,0.0001148586,0.0003158542,0.0007294791,0.0003077869],"domain_scores_gemma":[0.9956368,0.002494632,0.0005475489,0.0006964953,0.0004188865,0.0002057472],"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.0004666447,0.00007977908,0.0007674779,0.0001335641,0.0000710127,0.00006204633,0.000127299,0.9051121,0.003366676,0.03417384,0.001626448,0.05401315],"study_design_scores_gemma":[0.00003142218,0.00007236326,0.0001285798,0.000007590879,0.00001318396,0.00003144266,0.00001513334,0.9828902,0.0013868,0.01469635,0.000718896,0.000008010902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032379,0.0004435715,0.9671956,0.0001773446,0.00005017638,0.00005798124,0.00006555727,0.0004340034,0.001251976],"genre_scores_gemma":[0.4756271,0.0006563204,0.5202271,0.00009777475,0.0001067915,0.0002064022,0.0002810208,0.0002247609,0.00257285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003885357,"threshold_uncertainty_score":0.02054799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009612584698921019,"score_gpt":0.1993969946474032,"score_spread":0.1897844099484821,"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."}}