A Novel Back-off Algorithm for Integration of Scheduling and Control of Batch Processes under Uncertainty
Bibliographic record
Abstract
A novel decomposition algorithm for the integration of scheduling and control of multiproduct, multiunit batch processes under stochastic parameter uncertainty is presented. This iterative algorithm solves a scheduling and dynamic optimization problem around a nominal point while approximating uncertainty through back-off terms, embedded in the operational process constraints. Monte Carlo simulations are performed to propagate uncertainty and to evaluate dynamic feasibility; statistical information is drawn from these simulations to update the back-off terms. Convergence of the algorithm results in a set of scheduling and control decisions that aim to keep the plant dynamically feasible under the effect of uncertainty up to a user-defined tolerance criterion. The proposed algorithm is shown to be successfully applied to a multiproduct, multiunit batch plant under the effects of different probability density functions in the uncertain parameters. The algorithm’s performance is gauged against a fully integrated, mixed logic dynamic optimization problem with multiscenario-based uncertainty. The solution to the integrated algorithm is obtained with mixed integer nonlinear programming solvers. Results show that the proposed decomposition algorithm remains computationally attractive, without compromising the quality of the solution.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".