A finite capacity bulk service queue with single vacation and Markovian arrival process.
A finite capacity queue with Markovian arrivals and two servers with group services.
A finite horizon production model with variable production rates and constant demand rate.
A Finite Time−Horizon Deterministic EOQ Model With Stock−Dependent Demand, Effects of Inflation and Time Value of Money With Shortages in All Cycles
A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning
In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments...
A fixed-size batch service queue with vacations.
A fluid model for a relay node in an ad hoc network: Evaluation of resource sharing policies.
A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks
A four-type decision-variable MINLP model for a supply chain network design.
A Fuzzy Approach to Evoluation and Management of Therapeutic Procedure in Diabetes Mellitus Treatment
A fuzzy logic approach to assembly line balancing.
This paper deals with the use of fuzzy set theory as a viable alternative method for modelling and solving the stochastic assembly line balancing problem. Variability and uncertainty in the assembly line balancing problem has traditionally been modelled through the use of statistical distributions. This may not be feasible in cases where no historical data exists. Fuzzy set theory allows for the consideration of the ambiguity involved in assigning processing and cycle times and the uncertainty contained...
A Fuzzy Model for Inventory Allocation in a Serial Production/Inventory System
A generalization of dynamic programming for Pareto optimization in dynamic networks
A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
The Algorithm in this paper is designed to find the shortest path in a network given time-dependent cost functions. It has the following features: it is recursive; it takes place bath in a backward dynamic programming phase and in a forward evaluation phase; it does not need a time-grid such as in Cook and Halsey and Kostreva and Wiecek's "Algorithm One”; it requires only boundedness (above and below) of the cost functions; it reduces to backward multi-objective dynamic programming if there are...
A generalization of the Erlang's B formula
A generalized residual information measure and its properties.
A Genetic Algorithm Approach to the Buyers' Welfare Problem of Product Line Design: A Comparative Computational Study
A goal programming model for selecting a facility location site
A good approximation of the inventory level in a perishable inventory system
A good approximation of the inventory level in a (Q, r) perishable inventory system
This paper derives a good approach to approximating the expected inventory level per unit time for the continuous review (Q, r) perishable inventory system. Three existing approximation approaches are examined and compared with the proposed approach. Three stockout cases, including the full backorder, the partial backorder, and the full lost sales cases, which customers or material users generally use to respond to a stockout condition are considered. This study reveals the fact that the...