-
作者：Angelus, Alexandar; Porteus, Evan L.
作者单位：Singapore Management University; Stanford University
摘要：We formulate a finite-horizon nonstationary dynamic single-asset assembly problem, which covers both a liquid-asset assembly problem, based on the work of Rosling published in 1989, where the single asset is the single product being assembled, and a fixed-asset assembly problem, in which the single asset is production capacity. In the latter case, capacity is assembled over time from components and may be used to manufacture many products. In the spirit of Rosling, we provide conditions under ...
-
作者：Zhang, Hao; Zenios, Stefanos
作者单位：University of Southern California; Stanford University
摘要：This paper proposes a general framework for a large class of multiperiod principal-agent problems. In this framework, a principal has a primary stake in the performance of a system but delegates its control to an agent. The underlying system is a Markov decision process, where the state of the system can only be observed by the agent but the agent's action is observed by both parties. This paper develops a dynamic programming algorithm to derive optimal long-term contracts for the principal. T...
-
作者：Anderson, Edward J.; Hu, Xinmin
作者单位：University of New South Wales Sydney
摘要：Firms compete in supply functions when they offer a schedule of prices and quantities into a market; for example, this occurs in many wholesale electricity markets. We study the equilibrium behaviour when firms differ, both with regard to their costs and their capacities. We characterize strong equilibrium solutions in which, given the other players' supply functions, optimal profits are achieved for every demand realisation. If the demand can be low enough for it to be met economically with s...
-
作者：Adelman, Daniel; Mersereau, Adam J.
作者单位：University of Chicago; University of North Carolina; University of North Carolina Chapel Hill
摘要：We consider a broad class of stochastic dynamic programming problems that are amenable to relaxation via decomposition. These problems comprise multiple subproblems that are independent of each other except for a collection of coupling constraints on the action space. We fit an additively separable value function approximation using two techniques, namely, Lagrangian relaxation and the linear programming (LP) approach to approximate dynamic programming. We prove various results comparing the r...
-
作者：Mahabhashyam, Sai Rajesh; Gautam, Natarajan; Kumara, Soundar R. T.
作者单位：Oracle; Texas A&M University System; Texas A&M University College Station; Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park
摘要：A system consisting of two buffers, each with independent fluid sources, is considered in this paper. Due to ease of implementation, the output capacities for the two buffers depend on the workload of only one of the buffers that is measured. A threshold-based policy is considered to dynamically assign output capacities for both buffers. Marginal workload distributions for the two buffers need to be evaluated for this policy. The key contribution of this paper is the performance analysis to de...
-
作者：Jaillet, Patrick; Wagner, Michael R.
作者单位：Massachusetts Institute of Technology (MIT); California State University System; California State University East Bay
摘要：We consider online routing optimization problems where the objective is to minimize the time needed to visit a set of locations under various constraints; the problems are online because the set of locations are revealed incrementally over time. We consider two main problems: (1) the online traveling salesman problem (TSP) with precedence and capacity constraints, and (2) the online TSP with m salesmen. For both problems we propose online algorithms, each with a competitive ratio of 2; for the...
-
作者：Lim, Andrew; Rodrigues, Brian; Xu, Zhou
作者单位：Hong Kong University of Science & Technology; Singapore Management University; Hong Kong Polytechnic University
摘要：Transportation companies that operate in seasonal markets where differences in demand occur in peak and nonpeak periods often negotiate for some form of demand smoothing with the customer-i.e., the shipper. In this paper, we study a shipper's transportation procurement model, in which the shipper gives assurances, through volume guarantees negotiated with the transportation companies, that shipments made in nonpeak periods will be commensurate with shipments in peak periods. The shipper uses t...
-
作者：Han, Qiaoming; Du, Donglei; Vera, Juan; Zuluaga, Luis F.
作者单位：Nanjing University; University of New Brunswick; University of Waterloo
摘要：A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance between the two players is two. We show that the symmetric rendezvous value is within the interval (4.1520, 4.2574), which considerably improves the previous best-known result (3.9546, 4.3931). To achieve the improved bounds, we call upon results from absorbing Markov chain theory and mathematical programming theory-parti...
-
作者：Huh, Woonghee Tim; Janakiraman, Ganesh
作者单位：Columbia University; New York University
摘要：We study a stationary, single-stage inventory system, under periodic review, with fixed ordering costs and multiple sales levers (such as pricing, advertising, etc.). We show the optimality of (s, S)-type policies in these settings under both the backordering and lost-sales assumptions. Our analysis is constructive and is based on a condition that we identify as being key to proving the (s, S) structure. This condition is entirely based on the single-period profit function and the demand model...
-
作者：Sodhi, ManMohan S.; Tang, Christopher S.
作者单位：City St Georges, University of London; University of California System; University of California Los Angeles
摘要：We believe that research, teaching, and practice are becoming increasingly disengaged from one another in the OR/MS ecosystem. This ecosystem comprises researchers, educators, and practitioners in its core along with end users, universities, and funding agencies. Continuing disengagement will result in OR/MS occupying only niche areas and disappearing as a distinct field even though its tools would live on. To understand the reasons for this disengagement better and to engender discussion amon...
