-
作者：HOF, J; BALTIC, T
摘要：This paper reports an analysis of multiresources production capabilities of the National Forest System for the purpose of national planning in the USDA Forest Service. The analysis identifies previously unrecognized limits to the productive capabilities of the National Forest System. The analysis was used by Forest Service planners to define the long-run planning problem and to develop alternative strategies for addressing that problem. We test a multilevel optimization approach and apply it t...
-
作者：ROGERS, DF; PLANTE, RD; WONG, RT; EVANS, JR
作者单位：Purdue University System; Purdue University; Nokia Corporation; Nokia Bell Labs; AT&T
摘要：A fundamental issue in the use of optimization models is the tradeoff between the level of detail and the ease of using and solving the model. Aggregation and disaggregation techniques have proven to be valuable tools for manipulating data and determing the appropriate policies to employ for this tradeoff. Furthermore, aggregation and disaggregation techniques offer promise for solving large-scale optimization models, supply a set of promising methodologies for studying the underlying structur...
-
作者：YANG, WN; NELSON, BL
作者单位：University System of Ohio; Ohio State University; University System of Ohio; Ohio State University
摘要：This paper considers the determination of the relative merits of two or more system designs via stochastic simulation experiments by constructing simultaneous interval estimates of certain differences in expected performance. Tukey's all-pairwise-comparisons procedure, Hsu's multiple-comparisons-with-the-best procedure, and Dunnett's multiple-comparisons-with-a-control procedure are standard methods for making such comparisons. We propose refinements for all three procedures through the use of...
-
作者：SOUNDERPANDIAN, J
摘要：A necessary condition for the widely used additive value function is total preferential independence, or somewhat equivalently, total substitutability among the decision criteria. We consider cases where total substitutability is absent, and study the value functions that are applicable to such cases. First we take the case of total nonsubstitutability, and prove that the maximum value function is appropriate for it. This result easily extends to the closely related maximax value function. Nex...
-
作者：BERTSIMAS, DJ; VANRYZIN, G
作者单位：Massachusetts Institute of Technology (MIT)
摘要：We propose and analyze a generic mathematical model for dynamic, stochastic vehicle routing problems, the dynamic traveling repairman problem (DTRP). The model is motivated by applications in which the objective is to minimize the wait for service in a stochastic and dynamically changing environment. This is a departure from classical vehicle routing problems where one seeks to minimize total travel time in a static, deterministic environment. Potential areas of application include repair, inv...
-
作者：LABBE, M; LAPORTE, G; MERCURE, H
作者单位：Universite de Montreal
摘要：T = (V, E) is a tree with nonnegative weights associated with each of its vertices. A fleet of vehicles of capacity Q is located at the depot represented by vertex upsilon-1. The Capacitated Vehicle Routing Problem on Trees (TCVRP) consists of determining vehicle collection routes starting and ending at the depot such that: the weight associated with any given vertex is collected by exactly one vehicle; the sum of all weights collected by a vehicle does not exceed Q; a linear combination of th...
-
作者：NOON, CE; BEAN, JC
作者单位：University of Michigan System; University of Michigan
摘要：This paper presents an optimal approach for the asymmetric Generalized Traveling Salesman Problem (GTSP). The GTSP is defined on a directed graph in which the nodes are grouped into m predefined, mutually exclusive and exhaustive sets with the arc set containing no intraset arcs. The problem is to find a minimum cost m-arc directed cycle which includes exactly one node from each set. Our approach employs a Lagrangian relaxation to compute a lower bound on the total cost of an optimal solution....
-
作者：ITTIMAKIN, P; KAO, EPC
作者单位：University of Houston System; University of Houston
摘要：We consider the multiserver queueing system studied originally by L. Green (1980) in which customers request service from a random number of identical servers. We provide a matrix-geometric formulation of the problem, present a simple means for computing the stationary probability vector, and propose an algorithm based on randomization for computing the waiting time distribution. We also give a numerical example and discuss issues involved in extending the formulation to include customer prior...
-
作者：CHAMBERS, RJ; CARRAWAY, RL; LOWE, TJ; MORIN, TL
作者单位：University of Virginia; University of Iowa; Purdue University System; Purdue University
摘要：New heuristic dominance rules and a flexible decomposition heuristic are developed for the problem of minimizing weighted tardiness on a single processor. Extensive computational experience demonstrates that, when our new heuristic dominance rules were incorporated into an optimal algorithm, optimal or nearly optimal solutions were obtained quickly. In fact, solution times were orders of magnitude faster than those using the optimal algorithm alone. On larger problems, our decomposition heuris...
-
作者：HOCHBAUM, DS; SHAMIR, R
作者单位：Rutgers University System; Rutgers University New Brunswick
摘要：A high multiplicity scheduling problem consists of many jobs which can be partitioned into relatively few groups, where all the jobs within each group are identical. Polynomial, and even strongly polynomial, algorithms for the standard scheduling problem, in which all jobs are assumed to be distinct, become exponential for the corresponding high multiplicity problem. In this paper, we study various high multiplicity problems of scheduling unit-time jobs on a single machine. We provide strongly...
