{"id":"W1999219034","doi":"10.1142/s0129054110007118","title":"APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Polynomial-time approximation scheme; Approximation algorithm; Job shop scheduling; Time complexity; Mathematics; Algorithm","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.0005709577,0.00007936843,0.0001108379,0.0003689212,0.00007884981,0.0001713673,0.0006261891,0.00002958407,0.00002028991],"category_scores_gemma":[0.0001852401,0.00006958035,0.00004566661,0.0002765715,0.0003683715,0.000792212,0.00002655428,0.0001481258,0.000001507835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003622883,"about_ca_system_score_gemma":0.0002342327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.020356e-7,"about_ca_topic_score_gemma":0.00000206926,"domain_scores_codex":[0.9989245,0.000005850951,0.0003600481,0.0001004685,0.0004982339,0.0001109006],"domain_scores_gemma":[0.9976506,0.0001130873,0.0002280001,0.0001090749,0.00183375,0.00006553792],"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.00003373428,0.00009795309,0.001545811,0.00002741928,0.0001187319,0.000002174663,0.0006968105,0.755022,0.02442002,0.02173398,0.00002407056,0.1962773],"study_design_scores_gemma":[0.0005265847,0.00007001258,0.0009638957,0.00008698936,0.000007557457,0.000115724,0.00004359549,0.9759645,0.02135079,0.0006035814,0.0001716769,0.0000951059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.192002,0.000009050653,0.8058525,0.0001913526,0.001726892,0.00007272781,0.000004451059,0.00002333162,0.0001177092],"genre_scores_gemma":[0.5046532,0.000003377517,0.4951652,0.00001164372,0.0001563168,0.000002041721,0.000001916151,0.000004105429,0.00000217493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3126513,"threshold_uncertainty_score":0.2837405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01225638514331587,"score_gpt":0.2719652398540387,"score_spread":0.2597088547107228,"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."}}