{"id":"W1978587158","doi":"10.1007/s10479-013-1522-1","title":"Supply chain scheduling to minimize holding costs with outsourcing","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Outsourcing; Theory of computation; Shortest path problem; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Supply chain; Bounded function; Holding cost; Polynomial-time approximation scheme; Computer science; Time complexity; Longest path problem; Mathematics; Approximation algorithm; Combinatorics; Algorithm; Business; Computer network","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.002105874,0.001550826,0.002563543,0.001202837,0.001287312,0.001828853,0.002021225,0.001533804,0.008177202],"category_scores_gemma":[0.003939156,0.001276755,0.001317797,0.003832735,0.0009108325,0.00261632,0.00147449,0.001815993,0.0005177245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002951511,"about_ca_system_score_gemma":0.003882512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01032815,"about_ca_topic_score_gemma":0.008547979,"domain_scores_codex":[0.9990634,0.000352123,0.000035406,0.0001289104,0.0001791404,0.0002410126],"domain_scores_gemma":[0.998584,0.0007960732,0.0001321832,0.0001575649,0.0001622202,0.0001680133],"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.0002737382,0.0001277725,0.0004698351,0.0001320434,0.00006929256,0.00007992771,0.00006789415,0.9589534,0.001204996,0.01079265,0.002099075,0.02572933],"study_design_scores_gemma":[0.0000473087,0.0001116353,0.0002924133,0.00001698899,0.0000408855,0.00002583886,0.00005242422,0.9830041,0.0008540355,0.01477827,0.0007648954,0.00001107776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1455697,0.0009286048,0.8356465,0.001195293,0.0003123704,0.0005166754,0.0005269976,0.0004728979,0.01483101],"genre_scores_gemma":[0.8298767,0.0007196144,0.1570133,0.0001602732,0.0002171056,0.0002750981,0.0002930242,0.0002392869,0.01120558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01032815,"threshold_uncertainty_score":0.02735543,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08653777754906168,"score_gpt":0.3666433294800415,"score_spread":0.2801055519309799,"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."}}