{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003680455,0.002478319,0.002722735,0.001720251,0.001109353,0.002110119,0.003289416,0.002895614,0.005295215],"category_scores_gemma":[0.01221882,0.001055185,0.001390038,0.00428945,0.001212672,0.003438393,0.001842563,0.002611961,0.0009487609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003665894,"about_ca_system_score_gemma":0.003333966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008268837,"about_ca_topic_score_gemma":0.007233651,"domain_scores_codex":[0.9980347,0.0008687814,0.0000892919,0.0002835129,0.0003959466,0.0003277132],"domain_scores_gemma":[0.9941339,0.004618687,0.0004165205,0.0003057204,0.0003100699,0.0002150883],"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.0002021558,0.0001944813,0.0005430618,0.0001553761,0.00007054622,0.00003901327,0.00009790124,0.9459857,0.0003390863,0.0160307,0.004025071,0.03231686],"study_design_scores_gemma":[0.00005951014,0.00003155091,0.00007223141,0.00001042645,0.00001415888,0.00001747092,0.00002056309,0.9870711,0.0001226595,0.01208877,0.0004860472,0.000005495886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04590318,0.00192498,0.9409108,0.001319117,0.0001313038,0.0002913639,0.0004258937,0.0006181032,0.008475302],"genre_scores_gemma":[0.3810336,0.001987046,0.6093376,0.000421165,0.0002641,0.0007932687,0.001334856,0.0003060444,0.004522346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008268837,"threshold_uncertainty_score":0.02659804,"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."}}