Now showing items 201-210 of 231
An efficient algorithm for the single machine total tardiness problem
(Taylor & Francis, 2001)
This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ...
Designing a road network for hazardous materials shipments
We consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the ...
The stochastic joint replenishment problem: a new policy, analysis, and insights
(John Wiley & Sons, 2006)
In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single-location, N-item setting. The replenishment decisions are based on both group reorder point-group order quantity ...
Virtual Private Network Design Under Traffic Uncertainty
We propose different formulations as well as efficient solution approaches for the VPN design problem under traffic uncertainty with symmetric bandwidths. © 2004 Elsevier B.V. All rights reserved.
Optimal bundle formation and pricing of two products with limited stock
In this study, we consider the stochastic modeling of a retail firm that sells two types of perishable products in a single period not only as independent items but also as a bundle. Our emphasis is on understanding the ...
The Turkish army uses simulation to model and optimize its fuel-supply system
(Institute for Operations Research and the Management Sciences (INFORMS), 2005)
Moving military troops, which is critical to tactical success, depends on providing large quantities of fuel. We used simulation to model and analyze the Turkish army's fuel-supply system that consists of sea-going tankers, ...
Supplier diversification under binomial yield
We consider supplier diversification in an EOQ type inventory setting with multiple suppliers and binomial yields. We characterize the optimal policy for the model and show that, in this case, it does not pay to diversify, ...
Tree network 1-median location with interval data: a parameter space-based approach
(Taylor & Francis, 2005)
We consider a family of 1-median location problems on a tree network where the vertex weights are ranges rather than point values. We define a new framework for making sound decisions under uncertainty which is primarily ...
Designing a road network for hazardous materials transportation
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2004)
Dangerous-goods shipments remain regulated despite the widespread deregulation of the transportation industry. This is mainly due to the societal and environmental risks associated with these shipments. One of the common ...
Z-theorems: Limits of stochastic equations
(International Statistical Institute, 2000)
Let fn(è, ù) be a sequence of stochastic processes which converge weakly to a limit process f 0(è, ù). We show under some assumptions the weak inclusion of the solution sets èn(ù) fè : fn(è, ù) 0g in the limiting ...