On a probability problem connected with railway traffic.
On a stochastic inventory model with deteriorating items.
On a Volume Flexible Production Policy in a Family Production Context
On infinite dams with Markov dependent inputs
On inventory system with random lead time and repeated demands.
On some integral inequalities related with the multicommodity inventory model
On the Ball Spanned by Balls.
On the computational complexity of centers locating in a graph
It is shown that the problem of finding a minimum -basis, the -center problem, and the -median problem are -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal -center problem is also -complete.
On the optimality of inventory policies: A quasivariational approach.
Online LIB problems : heuristics for bin covering and lower bounds for bin packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
Optimal and near-optimal () inventory policies for Levy demand processes
Optimal and Near-Optimal (s,S) Inventory Policies for Levy Demand Processes
A Levy jump process is a continuous-time, real-valued stochastic process which has independent and stationary increments, with no Brownian component. We study some of the fundamental properties of Levy jump processes and develop (s,S) inventory models for them. Of particular interest to us is the gamma-distributed Levy process, in which the demand that occurs in a fixed period of time has a gamma distribution. We study the relevant properties of these processes, and we develop a quadratically convergent...
Optimal Batch Production Strategies Under Continuous Price Decrease and Time Discounting
Optimal control of a production system with inventory-level-dependent demand.
Optimal control of a production-inventory system with state constraints and a quadratic cost criterion
Optimal control of an inventory system with ameliorating and deteriorating items.
Optimal control of deteriorating production inventory systems.
Optimal control of production inventory systems with deteriorating items and dynamic costs.
Optimal Inventory Policies for Imperfect Inventory With Price Dependent Stochastic Demand and Partially Backlogged Shortages