{"id":"W2001444496","doi":"10.1142/s0129054105003030","title":"APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McMaster University","keywords":"Job shop scheduling; Job shop; Mathematical optimization; Generalization; Approximation algorithm; Scheduling (production processes); Computer science; Scheme (mathematics); Flow shop scheduling; Algorithm; Process (computing); Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.002861777,0.001592089,0.001807144,0.00117736,0.001005288,0.002354629,0.002817925,0.001771689,0.004120077],"category_scores_gemma":[0.01173604,0.000741696,0.001421366,0.002328497,0.001224649,0.002934444,0.001997944,0.002951231,0.001012986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233733,"about_ca_system_score_gemma":0.001711455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004457215,"about_ca_topic_score_gemma":0.004005881,"domain_scores_codex":[0.9979088,0.0007487927,0.0001032378,0.000264518,0.0005917752,0.0003827758],"domain_scores_gemma":[0.9950984,0.003317385,0.0003571668,0.0005954784,0.0003935904,0.0002379845],"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.0001989417,0.0001213045,0.0004493026,0.0001801276,0.00006143573,0.00007579408,0.0001204844,0.8462582,0.0006598526,0.08692036,0.005962395,0.05899179],"study_design_scores_gemma":[0.00003216859,0.00002281308,0.00005456272,0.00001458904,0.000008667956,0.00002624262,0.00002332429,0.9498129,0.0001322582,0.04853842,0.001328317,0.000005750966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01210301,0.001726877,0.9791965,0.0005481791,0.0001407757,0.00007571248,0.0001347808,0.0007339673,0.005340162],"genre_scores_gemma":[0.4186392,0.002550504,0.5692236,0.0004085563,0.0003137718,0.0004072585,0.0009648096,0.0004222386,0.007070107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457215,"threshold_uncertainty_score":0.01695865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0273347959252601,"score_gpt":0.2993553875880289,"score_spread":0.2720205916627688,"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."}}