Tensors are effective representations for complex and time-varying networks. The factorization of a tensor provides a high-quality low-rank compact basis for each dimension of the tensor, which facilitates the interpretation of important structures of the represented data. Many existing tensor factorization (TF) methods assume there is one tensor that needs to be decomposed to low-rank factors....

We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and general setup time distribution. The objective is to minimize the expected holding cost due to the waiting of jobs. A setup time is required to switch from one queue to another. We provide a ...

This paper presents a study of solving the joint replenishment problem (JRP) by using the RAND method, a heuristic approach that has been proven to find almost as good as optimal solutions, under uncertain customer demands and inaccurate unit holding cost estimation. The classical JRP deals with the issue of determining a replenishment policy that minimizes the total cost of replenishing multip...

The present study aimed to evaluate the influence of various heat-pressing procedures (different holding time and heat pressing temperature) on the microstructure and flexural strength of lithium disilicate glass ceramic. An experimental lithium silicate glass ceramic (ELDC) was prepared from the SiO2-Li2O-K2O-Al2O3-ZrO2-P2O5 system and heat-pressed following different procedures by varying tem...

We study an EOQ inventory model with demand rate and holding cost rate per unit time, both potentially dependent on the stock level. The ordering cost, the holding cost and the gross profit from the sale of the item are considered. The objective is to maximize the average profit per unit time. We present the analytical formulation of the problem and demonstrate the existence and uniqueness of t...

In this paper we consider the problem of allocating bandwidth to two transmitters/queues with arbitrary arrival processes, so as to minimize the total expected (discounted) holding cost of backlogged packets in the system over a finite (infinite) horizon. The bandwidth is in the form of time slots in a TDMA schedule. Allocation decisions are made based on the queue backlog information, which is...

the purpose of this article is to investigate a two-echelon supply chain inventory problem consisting of a single-vendor and a single-buyer with controllable lead time and investment for quality improvements. this paper presents an integrated vendor-buyer inventory model in order to minimize the sum of the ordering cost, holding cost, setup cost, investment for quality improvement and crashing ...