{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005964912,0.00140443,0.00122917,0.00525541,0.001397041,0.004909874,0.002464118,0.002375315,0.01140073],"category_scores_gemma":[0.009751476,0.0007817526,0.0016333,0.008882586,0.009965333,0.008154706,0.002742171,0.007810041,0.001824173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004552871,"about_ca_system_score_gemma":0.003466822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008871724,"about_ca_topic_score_gemma":0.004915998,"domain_scores_codex":[0.9941626,0.003153209,0.0003184956,0.0004888203,0.001661522,0.0002153763],"domain_scores_gemma":[0.9883874,0.009101157,0.0003115669,0.0004640824,0.001562416,0.0001734301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001140931,0.00002150134,0.0001369076,0.000344712,0.00001587516,0.00005545944,0.0001694702,0.002337289,0.00007242558,0.9660841,0.005974481,0.02477628],"study_design_scores_gemma":[0.00001335134,0.00004289911,0.0002126354,0.0004277557,0.00001625089,0.0001646408,0.0002512083,0.01206425,0.0002754566,0.8437518,0.1427547,0.00002486578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004992049,0.05742436,0.7405602,0.03720861,0.002691368,0.0001172629,0.000526269,0.0002879045,0.1561921],"genre_scores_gemma":[0.249922,0.09959502,0.5957809,0.02102204,0.008983321,0.0005823552,0.0005864594,0.0005475454,0.02298042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01140073,"threshold_uncertainty_score":0.03813922,"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."}}