{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371769,0.000111584,0.0001713858,0.0004601431,0.0002400508,0.0001539481,0.0002176908,0.0000604005,0.00007070326],"category_scores_gemma":[0.0005660083,0.000103049,0.00003110548,0.0008206545,0.00005166147,0.0001612686,0.00004548886,0.0002612834,0.0000713392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742211,"about_ca_system_score_gemma":0.00004620859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008396775,"about_ca_topic_score_gemma":0.00004408355,"domain_scores_codex":[0.9986122,0.0001090142,0.0002408999,0.0001973859,0.0004504424,0.0003900182],"domain_scores_gemma":[0.9986435,0.000183962,0.000008669012,0.0002980843,0.0006812001,0.0001846135],"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.00001108879,0.00001941625,0.0003123173,0.00001871671,0.00002068234,0.0000010282,0.0006130376,0.9913083,0.002327997,0.001000042,0.0002284328,0.004138913],"study_design_scores_gemma":[0.0002472543,0.00009491981,0.0004822538,0.0001437381,0.000002503509,0.000002566258,0.0005924911,0.9685674,0.02929763,0.000008683363,0.0004162871,0.000144275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5441038,0.0001249511,0.4499258,0.002415745,0.00008650176,0.0003065953,0.00001015808,0.0001427506,0.002883655],"genre_scores_gemma":[0.8107948,0.00003731957,0.1886448,0.0001052994,0.0001104293,0.00004718029,0.00001285912,0.00003324047,0.0002141135],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.266691,"threshold_uncertainty_score":0.4202215,"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."}}