{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007922118,0.0008519348,0.0008896505,0.000332022,0.0003614753,0.001127768,0.0007321687,0.0007979472,0.001554132],"category_scores_gemma":[0.001536278,0.0004967644,0.0006987699,0.0005163968,0.0006883749,0.0007793824,0.0006794711,0.001080248,0.0002253869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009474001,"about_ca_system_score_gemma":0.002373973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008925023,"about_ca_topic_score_gemma":0.006453319,"domain_scores_codex":[0.999671,0.0001128998,0.00001117093,0.00006172311,0.00009760293,0.00004559705],"domain_scores_gemma":[0.9995106,0.0003107437,0.00005359007,0.00002438563,0.00006968996,0.0000309517],"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.00001280664,0.00001065741,0.00007070311,0.00002003056,0.000005963649,0.00001417041,0.000008576581,0.9920573,0.0004119561,0.003470964,0.0001554121,0.003761354],"study_design_scores_gemma":[0.000002096289,0.000005707207,0.00001252839,9.695874e-7,8.419801e-7,0.000001596136,0.000001622759,0.9989042,0.00008356963,0.0008348189,0.0001511106,8.795747e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01476466,0.0002462158,0.9803295,0.0001932664,0.00004853773,0.00004285369,0.00005395183,0.0001174924,0.00420342],"genre_scores_gemma":[0.6933631,0.000540438,0.2985056,0.0001234576,0.00006172847,0.0003160598,0.0002329646,0.0001196473,0.006736979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008925023,"threshold_uncertainty_score":0.01774615,"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."}}