{"id":"W2119223389","doi":"10.1080/00207541003690116","title":"A bilinear programming model and a modified branch-and-bound algorithm for production planning in steel rolling mills with substitutable demand","year":2010,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Bilinear interpolation; Sizing; Branch and bound; Production (economics); Production planning; Curse of dimensionality; Integer programming; Linear programming; Integer (computer science); Schedule; Process (computing); Computer science; Algorithm; Mathematics; Economics","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":[],"consensus_categories":[],"category_scores_codex":[0.00300146,0.0001092401,0.000151723,0.000969212,0.0001802004,0.0004132536,0.0001841526,0.00004625076,0.000006926556],"category_scores_gemma":[0.0004824793,0.00009004435,0.00003034623,0.0002967099,0.0001637159,0.001366765,0.00008537815,0.0004201608,0.000001106901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005233059,"about_ca_system_score_gemma":0.00005892053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007462484,"about_ca_topic_score_gemma":0.00007398216,"domain_scores_codex":[0.9984351,0.00001878204,0.0003401377,0.0002928384,0.0006735635,0.0002395591],"domain_scores_gemma":[0.998411,0.00004219739,0.0001952459,0.00009882096,0.00122907,0.00002366546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004111614,0.001578457,0.05879694,0.001136414,0.0007724736,0.0001356751,0.003459535,0.2868412,0.07657986,0.01269089,0.004972697,0.5489243],"study_design_scores_gemma":[0.004512305,0.0002024209,0.00501322,0.0007338002,0.00007497678,0.0002402791,0.002396974,0.9253823,0.004241433,0.01216271,0.04455609,0.0004834833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823298,0.0001748399,0.01182701,0.003815776,0.001026398,0.0006451579,9.009109e-7,0.0000158493,0.0001643045],"genre_scores_gemma":[0.9834704,0.00005751356,0.01302156,0.00006952258,0.002831834,0.00005492835,0.000006530439,0.00002053843,0.0004671771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6385412,"threshold_uncertainty_score":0.3985014,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07658047894423728,"score_gpt":0.3466042592072398,"score_spread":0.2700237802630026,"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."}}