-
作者：Bollapragada, S; Bussieck, MR; Mallik, S
作者单位：General Electric; University of Illinois System; University of Illinois Urbana-Champaign
摘要：This paper, motivated by the experiences of a major U.S.-based broadcast television network, presents algorithms and heuristics to schedule commercial videotapes. Major advertisers purchase several slots to air commercials during a given time period on a broadcast network. We study the problem of scheduling advertiser's commercials in the slots it purchased when the same commercial is to be aired multiple times. Under such a situation, the advertisers typically want the airings of a commercial...
-
作者：Sun, P; Freund, RM
作者单位：Duke University; Massachusetts Institute of Technology (MIT)
摘要：We present a practical algorithm for computing the minimum-volume n-dimensional ellipsoid that must contain m given points a(1),..., a(m) is an element of R-n. This convex constrained problem arises in a variety of applied computational settings, particularly in data mining and robust statistics. Its structure makes it particularly amenable to solution by interior-point methods, and it has been the subject of much theoretical complexity analysis. Here we focus on computation. We present a comb...
-
作者：Chen, FR; Samroengraja, R
作者单位：Columbia University; Pitney Bowes Inc.
摘要：The bullwhip effect (amplification of order variance from a downstream stage in a supply chain to an upstream stage) is widely observed in practice, and is generally considered a major cause of supply chain inefficiencies. But are supply chains always better off with strategies that are designed to dampen the bullwhip effect? This paper considers a model where a single product is sold through multiple retail outlets. The retailers replenish their inventories from a factory, which in turn reple...
-
作者：Baldacci, R; Hadjiconstantinou, E; Mingozzi, A
作者单位：Universita di Modena e Reggio Emilia; Imperial College London; University of Bologna
摘要：The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. In this paper, we describe a new integer programming formulation for the CVRP based on a two-commodity network flow approach. We present a lower bound derived from the linear programming (LP) relaxation of the new formulation which is improved by adding valid inequa...
-
作者：Parker, RP; Kapuscinski, R
作者单位：Yale University; University of Michigan System; University of Michigan
摘要：This paper demonstrates optimal policies for capacitated serial multiechelon production/inventory systems. Extending the Clark and Scarf (1960) model to include installations with production capacity limits, we demonstrate that a modified echelon base-stock policy is optimal in a two-stage system when there is a smaller capacity at the downstream facility. This is shown by decomposing the dynamic programming value function into value functions dependent upon individual echelon stock variables....
-
作者：Kim, NK; Chae, KC; Chaudhry, ML
作者单位：Chonnam National University; Korea Advanced Institute of Science & Technology (KAIST); Royal Military College - Canada
摘要：For a broad class of discrete- and continuous-time queueing systems, we show that the stationary number of customers in system (queue plus servers) is the sum of two independent random variables, one of which is the stationary number of customers in queue and the other is the number of customers that arrive during the time a customer spends in service. We call this relation an invariance relation in the sense that it does not change for a variety of single-sever queues (with batch arrivals and...
-
作者：Bradley, JR
作者单位：Cornell University
摘要：This paper considers a production-inventory problem where a manufacturer fulfills stochastic, stationary demand for a single product from a finished-goods inventory. The inventory can be replenished by two production resources, in-house production and a subcontractor, which both have finite capacity. We construct a Brownian approximation of the optimal control problem, assuming that the manufacturer uses a dual base-stock policy to control replenishment from the two sources and that her object...
-
作者：Dogramaci, A; Fraiman, NM
作者单位：Ihsan Dogramaci Bilkent University; Columbia University
摘要：How should a manager make replacement decisions for a chain of machines over time if each is maintained by an optimal control model addressing uncertainty of machine breakdowns? A network representation of the problem involves arcs with interdependent costs. A solution algorithm is presented and replacement considerations under technological change are incorporated into a well-known optimal control model for maintenance under uncertainty (that of Kamien and Schwartz 1971). The method is illust...
-
作者：Janakiraman, G; Roundy, RO
作者单位：New York University; Cornell University
摘要：We consider a single-location inventory system with periodic review and stochastic demand. It places replenishment orders to raise the inventory position-that is, inventory on hand plus inventory in transit-to exactly S at the beginning of every period. The lead time associated with each of these orders is random. However, the lead-time process is such that these orders do not cross. Demand that cannot be met with inventory available on hand is lost permanently. We state and prove some sample-...
-
作者：Ziya, S; Ayhan, H; Foley, RD
作者单位：University of North Carolina; University of North Carolina Chapel Hill; University System of Georgia; Georgia Institute of Technology
摘要：This note discusses the relationships among three assumptions that appear frequently in the pricing/revenue management literature. These assumptions are mostly needed for analytical tractability, and they have the common property of ensuring a well-behaved revenue function. The three assumptions are decreasing marginal revenue with respect to demand, decreasing marginal revenue with respect to price, and increasing price elasticity of demand. We provide proofs and examples to show that none of...
