The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 101 –
120 of
160
Analysis of empirical sales data lead us to consider newsboy model for four practical market conditions arising from the presence/absence of stochastic lead time and exogenous linear temporal decline in selling price when distribution of the stochastic demand depends upon initial selling price. Viability of the solutions is discussed for three strategies of obtaining optimal initial selling price and/or ordering quantity. Numerical studies are conducted to assess the effects of lead time and price...
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.
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...
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...
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...
Currently displaying 101 –
120 of
160