-
作者：Kalvenes, Joakim; Keon, Neil
作者单位：University of Texas System; University of Texas Dallas; Southern Methodist University
摘要：This paper considers the provisioning of transmission line bandwidth on a private network with given traffic routing for the purpose of distribution of video-on-demand service with guaranteed end-to-end quality of service. We present an architecture for video-on-demand service delivery and model the assignment of bandwidth in the distribution network as a constrained, nonlinear optimization problem. To solve this optimization problem, we develop three new auction algorithm-based solution proce...
-
作者：Crow, Charles S.; Goldberg, David; Whitt, Ward
作者单位：Massachusetts Institute of Technology (MIT); Columbia University
摘要：We introduce and investigate approximations for the probability distribution of the maximum of n independent and identically distributed nonnegative random variables, in terms of the number n and the first few moments of the underlying probability distribution, assuming the distribution is unbounded above but does not have a heavy tail. Because the mean of the underlying distribution can immediately be factored out, we focus on the effect of the squared coefficient of variation (SCV, c(2), var...
-
作者：Hu, Jiaqiao; Fu, Michael C.; Marcus, Steven I.
作者单位：State University of New York (SUNY) System; Stony Brook University; University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park
摘要：Model reference adaptive search (MRAS) for solving global optimization problems works with a parameterized probabilistic model on the solution space and generates at each iteration a group of candidate solutions. These candidate solutions are then used to update the parameters associated with the probabilistic model in such a way that the future search will be biased toward the region containing high-quality solutions. The parameter updating procedure in MRAS is guided by a sequence of implici...
-
作者：Fekete, Sandor P.; Schepers, Joerg; van der Veen, Jan C.
作者单位：Braunschweig University of Technology; International Business Machines (IBM); IBM Germany
摘要：Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent lit...
-
作者：Hooker, J. N.
作者单位：Carnegie Mellon University
摘要：We combine mixed-integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve problems in which the objective is to minimize cost, makespan, or total tardiness. We obtain significant...
-
作者：Plambeck, Erica L.; Ward, Amy R.
作者单位：Stanford University; University of Southern California
摘要：In an assemble-to-order system, a wide variety of products are rapidly assembled from component inventories in response to customer orders. We assume that orders must be filled within a product-specific target lead time. In the event that some of the components required to fill an order are out of stock, these components must be expedited. The objective is to minimize the expected infinite-horizon discounted cost of primary component production and expediting. Our formulation captures financia...
-
作者：Simchi-Levi, David
作者单位：Massachusetts Institute of Technology (MIT)
-
作者：Rothkopf, Michael H.
作者单位：Rutgers University System; Rutgers University New Brunswick; Rutgers University System; Rutgers University New Brunswick
摘要：In theory, the mathematically elegant Vickrey-Clarke-Groves process offers perfect efficiency with dominant truth-revealing strategies. However, it has many serious practical problems. This paper describes these problems and argues that research that aims to maintain the dominant truth-revealing strategies while compromising on the other practical issues is of limited practical value.
-
作者：Lim, Andrew E. B.; Shanthikumar, J. George
作者单位：University of California System; University of California Berkeley
摘要：In the area of dynamic revenue management, optimal pricing policies are typically computed on the basis of an underlying demand rate model. From the perspective of applications, this approach implicitly assumes that the model is an accurate representation of the real-world demand process and that the parameters characterizing this model can be accurately calibrated using data. In many situations, neither of these conditions are satisfied. Indeed, models are usually simplified for the purpose o...
-
作者：Correa, Jose R.; Schulz, Andreas S.; Stier-Moses, Nicolas E.
作者单位：Universidad Adolfo Ibanez; Massachusetts Institute of Technology (MIT); Columbia University
摘要：We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in this situation: All flow-carrying paths have the same length, i.e., these solutions are fair, which is in general not true for optimal flows in networks with nonlinear latency functions. In addition, the ...
