We study the one-warehouse multi-retailer (OWMR) problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-faci...

The recognition that optimal control trajectories for batch processes can be highly sensitive to model uncertainties has motivated the development of methods for explicitly addressing robustness during batch processes. This study explores the incorporation of robust performance analysis into open-loop and closed-loop optimal control design. Several types of robust performance objectives are inv...

This work reviews a well-known methodology for batch distillation modeling, estimation, and optimization but adds a new case study with experimental validation. Use of nonlinear statistics and a sensitivity analysis provides valuable insight for model validation and optimization verification for batch columns. The application is a simple, batch column with a binary methanol-ethanol mixture. Dyn...

Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch size at each epoch with a probability defined as a function of its previous su...

Batch-to-batch iterative learning control of a fed-batch fermentation process using batchwise linearised models identified from process operation data is presented in this paper. Due to model-plant mismatches and the present of unknown disturbances, off-line calculated control policy may not be optimal when implemented to the real process. The repetitive nature of batch process allows informati...

We study a version of the proximal gradient algorithm for which the gradient is intractable and is approximated by Monte Carlo methods (and in particular Markov Chain Monte Carlo). We derive conditions on the step size and the Monte Carlo batch size under which convergence is guaranteed: both increasing batch size and constant batch size are considered. We also derive non-asymptotic bounds for ...

We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B < n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the...

two batches of frankfurters containing about 55% chicken meat with two different oils (including canola and soybean) were manufactured. batch 1 included canola oil and batch 2 included soybean oil in the products. various analyses were performed to detect the lipid changes of both batches during storage. fatty acid composition analysis using gas chromatography showed little change in the fatty ...

Batch-wise variations, called intra-batch evolution here, widely exist in batch processes. In this paper, intra-batch evolution is tracked and monitored for multiphase batch processes. First, a batch cycle is divided into multiple phases. Within each phase, sliding windows are constructed for analysis of intra-batch relative variations, based on which different process modes are separated in or...