{"id":"W2467421149","doi":"10.11575/prism/33932","title":"Theory of constraints and linear programming: a reexamination","year":2000,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Operations Management Techniques","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear programming; Theory of constraints; Constraint (computer-aided design); Process (computing); Computer science; Throughput; Unit (ring theory); Mathematical optimization; Mathematics; Algorithm; Engineering; Operations management; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001190556,0.00005098695,0.0001339879,0.0002128535,0.00007743605,0.00001601994,0.0002897358,0.00006334908,0.001173293],"category_scores_gemma":[0.0001934603,0.00005186696,0.00003839465,0.0002579731,0.0004789964,0.000289692,0.00007986447,0.0000678474,0.00002055276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009300543,"about_ca_system_score_gemma":0.00002031276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003626148,"about_ca_topic_score_gemma":0.000003320376,"domain_scores_codex":[0.9991106,0.0001230535,0.0001489128,0.0001804467,0.0003649774,0.00007197865],"domain_scores_gemma":[0.9993077,0.0001880492,0.0001083407,0.0002371822,0.0001243153,0.00003440161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002065672,0.00004419395,0.0009556773,0.000004474558,0.000008399573,0.000003613047,0.0005699983,2.701625e-7,0.00009843012,0.01971961,0.0003515627,0.9782231],"study_design_scores_gemma":[0.003526814,0.001512328,0.3761084,0.0001978227,0.0002678005,0.00002260773,0.005968081,0.1091,0.004418327,0.1826604,0.3152876,0.0009297535],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5201941,0.0000394565,0.4124539,0.0003279757,0.00001445389,0.000285567,4.855897e-7,0.00004852713,0.06663557],"genre_scores_gemma":[0.8614252,0.00004353952,0.130532,0.00001985935,0.000002302878,2.403717e-7,0.000002184022,0.000002873405,0.007971868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9772934,"threshold_uncertainty_score":0.9997398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03656630155366634,"score_gpt":0.2792297403439566,"score_spread":0.2426634387902903,"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."}}