{"id":"W4392199080","doi":"10.1021/acs.iecr.3c03455","title":"Discrete-Time Network Scheduling and Dynamic Optimization of Batch Processes with Variable Processing Times through Discrete-Steepest Descent Optimization","year":2024,"lang":"en","type":"article","venue":"Industrial & Engineering Chemistry Research","topic":"Process Optimization and Integration","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Solver; Scheduling (production processes); Computer science; Discrete time and continuous time; Gradient descent; Discrete optimization; Method of steepest descent; Batch processing; Representation (politics); Optimization problem; Mathematics; Artificial neural network; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004589164,0.0003051586,0.0003048064,0.0001047753,0.0002200254,0.0006799651,0.0002133765,0.0003185565,0.0001343115],"category_scores_gemma":[0.0004528063,0.0002795998,0.00002834579,0.001819953,0.0001057221,0.0008355856,0.00006422911,0.0007146568,0.000002230043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001981718,"about_ca_system_score_gemma":0.0004080929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001130286,"about_ca_topic_score_gemma":9.378111e-7,"domain_scores_codex":[0.9981015,0.00002606825,0.0004349336,0.0004161994,0.0005057527,0.0005155358],"domain_scores_gemma":[0.99902,0.0002027206,0.00005156166,0.0002063188,0.0003979228,0.0001215208],"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.00003844088,0.00001609768,0.00001662895,0.00201629,0.00006095723,0.000003423463,0.0001338474,0.985773,0.01143241,0.00003019807,0.0001282986,0.0003504364],"study_design_scores_gemma":[0.0003460618,0.00004623374,6.682758e-7,0.002353768,0.00003718878,0.00001473201,0.00008878816,0.9680356,0.02841938,0.00001844786,0.0003471001,0.0002920552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006726038,0.004194173,0.9842296,0.0001453555,0.0001626872,0.0006106179,0.00004083782,0.0009068805,0.002983785],"genre_scores_gemma":[0.9306285,0.00108916,0.06608634,0.000004042816,0.0006059952,0.0001578096,0.0005374065,0.0002255473,0.0006651779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9239025,"threshold_uncertainty_score":0.9999656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02136283733108209,"score_gpt":0.2768807646496422,"score_spread":0.2555179273185602,"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."}}