-
作者：Goldfarb, D; Jin, ZY
作者单位：Columbia University
摘要：We present an O(nm)-time network simplex algorithm for finding a tree of shortest paths from a given node to all other nodes in a network of n nodes and m directed arcs or finding a directed cycle of negative length. The worst-case running time of this algorithm is as fast as that proved for any strongly polynomial algorithm and faster than that proved for any previously proposed simplex algorithm for this problem. We also show that this algorithm can be implemented in O(nlogn) time using O((m...
-
作者：Caron, G; Hansen, P; Jaumard, B
作者单位：Universite de Montreal; Polytechnique Montreal; Universite de Montreal; HEC Montreal
摘要：Consider an assignment problem in which persons are qualified for some but usually not all of the jobs. Moreover: assume persons belong to given seniority classes and jobs have given priority levels. Seniority constraints impose that the solution be such that no unassigned person can be given a job unless an assigned person with the same or higher seniority becomes unassigned. Priority constraints specify that the solution must be such that no unassigned job can become assigned without a job w...
-
作者：Federgruen, A; Heching, A
作者单位：Columbia University
摘要：This paper addresses the simultaneous determination of pricing and inventory replenishment strategies in the face of demand uncertainty. More specifically, we analyze the following single item, periodic review model. Demands in consecutive periods are independent, but their distributions depend on the item's price in accordance with general stochastic demand functions. The price charged in any given period can be specified dynamically as a function of the state of the system. A replenishment o...
-
作者：Jacobson, SH; Yücesan, E
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; INSEAD Business School
摘要：This paper uses computational complexity theory to assess the difficulty of various discrete event simulation problems. More specifically, accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling for discrete event simulations are formally stated as search problems and proven to be NP-hard. The consequences of these results cover a wide range of modeling and analysis problems in simulation. For example, problems associated with certain...
-
作者：Brimberg, J; Hurley, WJ; Johnson, RE
作者单位：University of Prince Edward Island; Royal Military College - Canada
摘要：We formulate and solve a location problem that determines where to position punt returners to maximize the number of punts caught. The problem is unusual within the location literature because it includes the dimension of time as well as Euclidean distance. The parameters of the model are estimated from actual punt return data. Our major finding is that the standard horizontal configuration of two punt returners results in only a small increase in the percentage of punts fielded over the case ...
-
作者：Bartholdi, JJ; Bunimovich, LA; Eisenstein, DD
作者单位：University System of Georgia; Georgia Institute of Technology; University of Chicago
摘要：We describe all possible asymptotic behavior of bucket brigade production lines with two or three workers, each characterized by a constant work velocity. The results suggest wariness in interpreting simulation results. They also suggest a strategy for partitioning a workforce into effective teams to staff the lines.
-
作者：Murty, KG; Djang, PA
作者单位：University of Michigan System; University of Michigan
摘要：For training National Guard units, the U.S. Army National Guard will field 21 combat vehicle training simulators called mobile trainers. Each National Guard unit must train at a station that is not farther than a specified maximum travel distance from its armory. We address the problem of finding: the optimum locations for the home bases for the mobile trainers, the locations of secondary training sites to which the mobile trainers will travel to provide training, and the actual routes that th...
-
作者：Petruzzi, NC; Dada, M
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; Purdue University System; Purdue University
摘要：In the newsvendor problem, a decision maker facing random demand for a perishable product decides how much of it to stock for a single selling period. This simple problem with its intuitively appealing solution is a crucial building block of stochastic inventory theory, which comprises a vast literature focusing on operational efficiency. Typically in this literature, market parameters such as demand and selling price are exogenous. However, incorporating these factors into the model can provi...
-
作者：Consiglio, A; Zenios, SA
作者单位：University of Calabria; University of Cyprus
摘要：We analyze the problem of debt issuance through the sale of innovative financial products. The problem is broken down to questions of designing the financial products, specifying the debt structure with the amount issued in each product, and determining an optimal level of financial leverage. We formulate a hierarchical optimization model to integrate these three issues and provide constructive answers. Input data for the models are obtained from Monte Carlo simulation procedures that generate...
-
作者：Li, HL
作者单位：National Yang Ming Chiao Tung University
摘要：This paper proposes an optimization model of incorporating competence sets of group decision makers to maximize the total benefit of the whole group. Such an incorporation model is formulated as finding a deduction graph linked from the nodes of existing competencies to the nodes of desired competencies. Compared with other methods treating competence set problems (Yu and Zhang 1991, Li and Yu 1994, and Shi and Yu 1996), the proposed model can solve problems involving multiple decision makers;...
