{"id":"W2071226715","doi":"10.1007/s10951-006-8790-4","title":"Approximation algorithms for shop scheduling problems with minsum objective: A correction","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Approximation algorithm; Job shop scheduling; Algorithm; Flow shop scheduling; Mathematics; 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.005016642,0.002040657,0.001800306,0.001959264,0.001836968,0.003708357,0.004874467,0.002626426,0.01348678],"category_scores_gemma":[0.04196945,0.001006879,0.002403101,0.004651596,0.002443883,0.007168603,0.002677747,0.01345369,0.007696826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002496826,"about_ca_system_score_gemma":0.002718123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005718468,"about_ca_topic_score_gemma":0.006618869,"domain_scores_codex":[0.9955161,0.001366501,0.0003719555,0.0007459672,0.001713651,0.0002858623],"domain_scores_gemma":[0.9807148,0.008014889,0.0005242915,0.004639439,0.005770544,0.0003359535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000710469,0.0002159581,0.001311275,0.001186104,0.0002627565,0.0003783939,0.0002259147,0.04748285,0.002430811,0.2636206,0.3069007,0.3752741],"study_design_scores_gemma":[0.0001747025,0.0001598329,0.001156458,0.0004638372,0.0002010387,0.00085395,0.0001392176,0.4559231,0.005008809,0.3159066,0.2198581,0.0001544062],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006018692,0.01474679,0.8520755,0.03196262,0.07546578,0.0000927263,0.0006942253,0.002027937,0.01691566],"genre_scores_gemma":[0.1504983,0.01529535,0.7149711,0.01291657,0.03392901,0.0003766569,0.0009976755,0.002853084,0.06816222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01348678,"threshold_uncertainty_score":0.04511774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01281881357312941,"score_gpt":0.230134956859749,"score_spread":0.2173161432866196,"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."}}