-
作者：Koek, A. Guerhan; Fisher, Marshall L.
作者单位：Duke University; University of Pennsylvania
摘要：Assortment planning at a retailer entails both selecting the set of products to be carried and setting inventory levels for each product. We study an assortment planning model in which consumers might accept substitutes when their favorite product is unavailable. We develop an algorithmic process to help retailers compute the best assortment for each store. First, we present a procedure for estimating the parameters of substitution behavior and demand for products in each store, including the ...
-
作者：Adelman, Daniel
作者单位：University of Chicago
摘要：Motivated by one of the leading intermodal logistics suppliers in the United States, we consider an internal pricing mechanism for managing a fleet of service units (shipping containers) flowing in a closed queueing network. Nodes represent geographic locations, and arcs represent travel between them. Customer requests for arcs arrive over time, and the problem is to find an accept/reject policy that maximizes the long-run time average reward rate from accepting requests. We formulate the prob...
-
作者：Ahn, Hyun-soo; Guemues, Mehmet; Kaminsky, Philip
作者单位：University of Michigan System; University of Michigan; McGill University; University of California System; University of California Berkeley
摘要：In most deterministic manufacturing decision models, demand is either known or induced by pricing decisions in the period that the demand is experienced. However, in more realistic market scenarios consumers make purchase decisions with respect to price, not only in the current period, but also in past and future periods. We model a joint manufacturing/pricing decision problem, accounting for that portion of demand realized in each period that is induced by the interaction of pricing decisions...
-
作者：Chen, Xin; Sim, Melvyn; Sun, Peng
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; National University of Singapore; Duke University
摘要：In this paper, we introduce an approach for constructing uncertainty sets for robust optimization using new deviation measures for random variables termed the forward and backward deviations. These deviation measures capture distributional asymmetry and lead to better approximations of chance constraints. Using a linear decision rule, we also propose a tractable approximation approach for solving a class of multistage chance-constrained stochastic linear optimization problems. An attractive fe...
-
作者：Chen, Zhi-Long; Hall, Nicholas G.
作者单位：University System of Maryland; University of Maryland College Park; University System of Ohio; Ohio State University
摘要：We study conflict and cooperation issues in supply chain manufacturing. Consider an assembly system where suppliers provide parts to a manufacturer. A product cannot be delivered until all its parts have been supplied. The manufacturer performs nonbottleneck operations, for example, outsourced assembly, packaging, and delivery for each product. Two classical scheduling objectives are considered: minimization of the total completion time and of the maximum lateness. We analyze how far from opti...
-
作者：Alexopoulos, Christos; Argon, Nilay Tank; Goldsman, David; Tokol, Gamze; Wilson, James R.
作者单位：University System of Georgia; Georgia Institute of Technology; University of North Carolina; University of North Carolina Chapel Hill; North Carolina State University
摘要：To estimate the variance parameter (i.e., the sum of covariances at all lags) for a steady-state simulation output process, we formulate certain statistics that are computed from overlapping batches separately and then averaged over all such batches. We form overlapping versions of the area and Cramer-von Mises estimators using the method of standardized time series. For these estimators, we establish (i) their limiting distributions as the sample size increases while the ratio of the sample s...
-
作者：Yang, Jian; Qin, Zhaoqiong
作者单位：New Jersey Institute of Technology; Embry-Riddle Aeronautical University
摘要：We study the optimal control of a firm with two capacitated manufacturing plants situated in two distinct geographical regions. Demands from each region are mostly satisfied by the local plant. However, if necessary, some of the newly arrived demands can be designated to be served by the other, more remote, plant. The sources of the above virtual lateral transshipments, unlike the ones involved in the real lateral transshipments, do not need to have nonnegative inventory levels throughout the ...
-
作者：Bertsimas, Dimitris; Mersereau, Adam J.
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); University of North Carolina; University of North Carolina Chapel Hill
摘要：When a marketer in an interactive environment decides which messages to send to her customers, she may send messages currently thought to be most promising (exploitation) or use poorly understood messages for the purpose of information gathering (exploration). We assume that customers are already clustered into homogeneous segments, and we consider the adaptive learning of message effectiveness within a customer segment. We present a Bayesian formulation of the problem in which decisions are m...
-
作者：Ahuja, Ravindra K.; Kumar, Arvind; Jha, Krishna C.; Orlin, James B.
作者单位：State University System of Florida; University of Florida; Massachusetts Institute of Technology (MIT)
摘要：The weapon-target assignment (WTA) problem is a fundamental problem arising, in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimal. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. No exact methods exist for the WTA problem that can solve even small-size problems (for examp...
-
作者：Baldacci, R.; Dell'Amico, M.; Gonzalez, J. Salazar
作者单位：University of Bologna; Universita di Modena e Reggio Emilia; Universidad de la Laguna
摘要：The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each nonvisited customer to a visited point or customer. The number of customers visited and assigned to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the total routing cost plus assignment costs. The problem has practical applications in the design of urban ...
