{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003194839,0.001162454,0.001425936,0.0009031601,0.00109609,0.002072883,0.00258866,0.001437443,0.004250666],"category_scores_gemma":[0.01266579,0.0007588172,0.001130824,0.002461144,0.001164381,0.004061746,0.002044982,0.002415409,0.0009500287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002560654,"about_ca_system_score_gemma":0.002405605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005229558,"about_ca_topic_score_gemma":0.004145388,"domain_scores_codex":[0.9976858,0.0005925287,0.0001614241,0.0003778543,0.0007018948,0.0004804705],"domain_scores_gemma":[0.9933987,0.003826599,0.0005068186,0.001518487,0.0004229788,0.0003264163],"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.001382216,0.0002546727,0.001143551,0.0003078852,0.0000885245,0.0001378021,0.000411303,0.7809461,0.006770462,0.08479472,0.008829021,0.1149338],"study_design_scores_gemma":[0.00008242612,0.00007915073,0.0001539597,0.00001755203,0.00002314315,0.00005448081,0.00003752755,0.9458687,0.001437602,0.0500701,0.002161195,0.00001416216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04689118,0.0009739573,0.9460057,0.0004957797,0.0001621481,0.0001210257,0.0002149519,0.0009879334,0.004147345],"genre_scores_gemma":[0.4720298,0.001088213,0.5198931,0.0003662018,0.0002423728,0.0002701222,0.001041028,0.0004335329,0.004635635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005229558,"threshold_uncertainty_score":0.01857901,"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."}}