{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760589,0.00007875459,0.0001179521,0.0004898135,0.00007088691,0.0001660758,0.0006768922,0.00002660408,0.0000204538],"category_scores_gemma":[0.00006754766,0.00007530671,0.00007649435,0.0003262617,0.00011522,0.001068927,0.0000337668,0.00007862377,0.000005490183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223933,"about_ca_system_score_gemma":0.0001355267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.462221e-7,"about_ca_topic_score_gemma":8.181965e-7,"domain_scores_codex":[0.998732,0.000006815825,0.0004958325,0.00009684452,0.0005481516,0.000120317],"domain_scores_gemma":[0.9979655,0.00007224743,0.0002016543,0.0001042373,0.001593726,0.00006265226],"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.000004233199,0.00003756093,0.00005279447,0.000007390469,0.00003287445,2.143968e-7,0.000273034,0.8612276,0.0007956343,0.002317586,0.0001789533,0.1350722],"study_design_scores_gemma":[0.0004372624,0.00005266986,0.0002884436,0.00005020482,0.000007540116,0.00004192419,0.00001691735,0.9900134,0.006409869,0.0008392285,0.001764289,0.00007827438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01139025,0.00006225438,0.9854447,0.0006321127,0.001944787,0.00009437454,0.000005879942,0.00004692834,0.0003787553],"genre_scores_gemma":[0.2711332,0.00002427846,0.7281913,0.00003769785,0.0005640781,0.000004087317,0.000004602145,0.000007327714,0.00003349431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2597429,"threshold_uncertainty_score":0.3070918,"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."}}