{"id":"W2094141022","doi":"10.1287/opre.1080.0622","title":"Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; University of Windsor","funders":"","keywords":"Supply chain; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Holding cost; Supply chain management; Approximation algorithm; Total cost; Inventory cost; Algorithm; Mathematics; Economics; Schedule; Business; Microeconomics; Marketing","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.001205405,0.0001277098,0.00012197,0.0002827243,0.0007212445,0.0004182523,0.0001995476,0.00008494294,0.00002937798],"category_scores_gemma":[0.0002048711,0.0001096303,0.00003239479,0.000521428,0.0000464456,0.0002286707,0.00003759973,0.0002695594,0.00002186031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001474641,"about_ca_system_score_gemma":0.00006187052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003045574,"about_ca_topic_score_gemma":0.00002826123,"domain_scores_codex":[0.998755,0.00006416658,0.0002366452,0.0002483402,0.0003149933,0.0003808511],"domain_scores_gemma":[0.9990647,0.0002219309,0.000007952968,0.0002315651,0.0003303707,0.0001434182],"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.00001271069,0.00002795665,0.00002899131,0.00002125961,0.00002070162,6.62278e-7,0.001098622,0.9358908,0.002809863,0.001924848,0.0006371501,0.05752646],"study_design_scores_gemma":[0.0004065407,0.00005863057,0.0001668369,0.00004127897,0.000006952003,0.000003526193,0.0009092913,0.9951579,0.00253835,0.00008575737,0.0004875516,0.0001374162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0945974,0.001157665,0.8956295,0.004972297,0.0002174207,0.002443145,0.00004264964,0.0002433318,0.0006965646],"genre_scores_gemma":[0.3784172,0.0002916357,0.6197267,0.0001606625,0.0002706309,0.0006065907,0.00007810887,0.0000361994,0.0004122824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2838198,"threshold_uncertainty_score":0.5547302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04923602046159838,"score_gpt":0.3225391663908933,"score_spread":0.2733031459292949,"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."}}