The multi-item single level capacitated dynamic lot-sizing problem consists of scheduling N items over a horizon of T periods. The objective is to minimize the sum of setup and inventory holding costs over the horizon subject to a constraint on total capacity in each period. No backlogging is allowed. Only one machine is available with a fixed capacity in each period. In case of a single item p...

In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...

This study proposes a two-phase, algebraic approach to resolve the rotation cycle time and number of shipments for a multi-item, economic production quantity (EPQ) model with a random defective rate. A conventional method for solving a multi-item EPQ model is to use differential calculus and Hessian matrix equations on system cost function to prove convexity first and then derive an optimal pro...

Sequential Recommender Systems (SRSs) aim to predict the next item that users will consume, by modeling user interests within their sequences. While most existing SRSs focus on a single type of behavior, only few pay attention multi-behavior sequences, although they are very common in real-world scenarios. It is challenging effectively capture because information about entangled throughout sequ...

Many cloud systems provide data stores with limited features, especially they may not provide transactions, or else restrict transactions to a single item. We propose a approach that gives multi-item transactions across heterogeneous data stores, using only a minimal set of features from each store such as single item consistency, conditional update, and the ability to include extra metadata wi...