-
作者：Guseo, Renato; Mortarino, Cinzia
作者单位：University of Padua
摘要：The aim of this note is to correct an error in the formulation of Theorem 1 by Savin and Terwiesch [Savin, S., C. Terwiesch. 2005. Optimal product launch times in a duopoly: Balancing life-cycle revenues with product cost. Oper. Res. 53(1) 26-47].
-
作者：Burke, E. K.; Hellier, R. S. R.; Kendall, G.; Whitwell, G.
作者单位：University of Nottingham
摘要：The no-fit polygon is a geometric construct that can offer faster and more efficient handling of geometry between pairs of shapes than traditional line-by-line intersection. The detection of intersections is a critical operation within the irregular two-dimensional stock-cutting problem (also known as nesting), which aims to place shapes onto sheets of material so that the material is utilised as efficiently as possible and the waste (or trim loss) is reduced. The problem forms an important pr...
-
作者：Weintraub, Gabriel Y.; Benkard, C. Lanier; Van Roy, Benjamin
作者单位：Columbia University; Yale University; Stanford University
摘要：Oblivious equilibrium is a new solution concept for approximating Markov-perfect equilibrium in dynamic models of imperfect competition among heterogeneous firms. In this paper, we present algorithms for computing oblivious equilibrium and for bounding approximation error. We report results from computational case studies that serve to assess both efficiency of the algorithms and accuracy of oblivious equilibrium as an approximation to Markov-perfect equilibrium. We also extend the definition ...
-
作者：Hall, Nicholas G.; Potts, Chris N.
作者单位：University System of Ohio; Ohio State University; University of Southampton
摘要：This paper considers scheduling problems where the processing of a set of jobs has been scheduled (i.e., planned) to minimize a classical cost objective, under the assumption that the jobs are all available at the start of the planning horizon. Before processing starts, however, the availability of a subset of the jobs is delayed. Therefore, the decision maker needs to adjust the existing schedule to allow for the initial unavailability of those jobs, but without causing excessive disruption t...
-
作者：Leung, Joseph Y. -T.; Pinedo, Michael; Wan, Guohua
作者单位：New Jersey Institute of Technology; New York University; Shanghai Jiao Tong University
摘要：We consider a scheduling environment with m (m >= 1) identical machines in parallel and two agents. Agent A is responsible for n(1) jobs and has a given objective function with regard to these jobs; agent B is responsible for n(2) jobs and has an objective function that may be either the same or different from the one of agent A. The problem is to find a schedule for the n(1) + n(2) jobs that minimizes the objective of agent A (with regard to his n(1) jobs) while keeping the objective of agent...
-
作者：Van den Heuvel, Wilco; Wagelmans, Albert P. M.
作者单位：Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC
摘要：In this paper, we analyze the worst-case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of online heuristics that is often applied in a rolling-horizon environment. We develop a procedure to systematically construct worst-case instances for a fixed time horizon and use it to derive worst-case problem instances for an infinite time horizon. Our analysis shows that any online heuristic has a worst-case rati...
-
作者：Park, Chiwoo; Huang, Jianhua Z.; Ding, Yu
作者单位：Texas A&M University System; Texas A&M University College Station; Texas A&M University System; Texas A&M University College Station
摘要：A minimum volume set of a probability density is a region of minimum size among the regions covering a given probability mass of the density. Effective methods for finding the minimum volume sets are very useful for detecting failures or anomalies in commercial and security applications-a problem known as novelty detection. One theoretical approach of estimating the minimum volume set is to use a density level set where a kernel density estimator is plugged into the optimization problem that y...
-
作者：Sapra, Amar; Truong, Van-Anh; Zhang, Rachel Q.
作者单位：Indian Institute of Management (IIM System); Indian Institute of Management Bangalore; Cornell University; Hong Kong University of Science & Technology
摘要：We study the inventory replenishment of a product whose demand can be manipulated by restricting the supply. This research is motivated by a novel marketing tactic employed by manufacturers of fashion and luxury items. Such a tactic combines innovative marketing with deliberate understocking in an attempt to create shortages (i.e., waitlists) that add to the allure and sense of exclusivity of a product and stimulate its demand. We model the problem as a finite-horizon, periodic-review system w...
-
作者：Levi, Retsef; Radovanovic, Ana
作者单位：Massachusetts Institute of Technology (MIT); Alphabet Inc.; Google Incorporated
摘要：Motivated by emerging applications in workforce management, we consider a class of revenue management problems in systems with reusable resources. The corresponding applications are modeled using the well-studied loss network systems. We use an extremely simple linear program (LP) that provides an upper bound on the best achievable expected long-run revenue rate. The optimal solution of the LP is used to devise a conceptually simple control policy that we call the class selection policy (CSP)....
-
作者：Honhon, Dorothee; Gaur, Vishal; Seshadri, Sridhar
作者单位：University of Texas System; University of Texas Austin; Cornell University
摘要：We present an efficient dynamic programming algorithm to determine the optimal assortment and inventory levels in a single-period problem with stockout-based substitution. In our model, total customer demand is random and comprises fixed proportion of customers of different types. Customer preferences are modeled through the definition of these types. Each customer type corresponds to a specific preference ordering among products. A customer purchases the highest-ranked product, according to h...
