-
作者：DOVERSPIKE, RD
摘要：The function of a digital telecommunications network is to transport demand of digital signals between pairs of locations. To achieve this economically, multiplex equipment packs lower rate digital signals into higher rate signals for routing over transmission facility links. Given a multiperiod demand forecast and demand routing plan, the multiplex bundling problem minimizes equipment and transmission costs by demultiplexing the higher rate signals into their lower rate components at various ...
-
作者：BOENDER, CGE; CARON, RJ; MCDONALD, JF; KAN, AHGR; ROMEIJN, HE; SMITH, RL; TELGEN, J; VORST, ACF
作者单位：University of Windsor; University of Twente; University of Michigan System; University of Michigan
摘要：We present a class of shake-and-bake algorithms for generating (asymptotically) uniform points on the boundary of full-dimensional bounded polyhedra. We also report results of simulations for some elementary test problems.
-
作者：ADLER, I; COSARES, S
作者单位：Telcordia Technologies
摘要：We extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some special properties associated with Leontief substitution systems and observing that a feasible solution to the system, Ax = b, x greater-than-or-equal-to 0, in which no variable appears in more than two equations, can be found in strongly polynomia...
-
作者：LABBE, M; THISSE, JF; WENDELL, RE
作者单位：Universite Catholique Louvain; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
摘要：This paper considers tradeoffs between cost and perturbations of the weights in a single facility, minisum location problem over a finite set of feasible points. Specifically, the paper characterizes a tradeoff curve of variability in the weights versus the degree of optimality of a solution. The general theoretical framework includes problems of location on a tree network and location using block norms; special results are given for these cases.
-
作者：JIANG, J; SETHI, SP
摘要：A hierarchical approach to control a manufacturing system, subject to multiple machine states modeled by a Markov process with weak and strong interactions, is suggested. The idea is to aggregate strongly interacting or high transition probability states within a group of states and consider only the transition between these groups for the analysis of the system in the long run. We show that such an aggregation results in a problem of reduced size, whose solution can be modified in a simple wa...
-
作者：MOSHEIOV, G
作者单位：City University of New York (CUNY) System; Baruch College (CUNY); Hebrew University of Jerusalem
摘要：A set of N jobs has to be processed on a single machine. Jobs have the same basic processing time, but the actual processing time of each job grows linearly with its starting time. A (possibly) different rate of growth is associated with each job. We show that the optimal sequence to minimize flow time is V-shaped: Jobs are arranged in descending order of growth rate if they are placed before the minimal growth rate job, and in ascending order if placed after it. Efficient (0(N log N)) asympto...
-
作者：LOFGREN, CB; MCGINNIS, LF; TOVEY, CA
摘要：The process planning problem is described for a class of flexible assembly systems for printed circuit cards. The general Problem of minimizing the number of station visits is shown to be NP-complete, and two classes of heuristics are shown to have arbitrarily bad worst case performance. Implications for design and operating discipline are discussed.
-
作者：BOXMA, OJ; KINDERVATER, GAP
作者单位：Tilburg University; Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam
摘要：Partitioning methods lend themselves very well to implementation on parallel computers. In recent years, branch-and-bound algorithms have been tested on various types of architectures. In this paper, we develop a queueing network model for the analysis of a class of branch-and-bound algorithms on a master-slave architecture. The analysis is based on a fluid flow approximation. Numerical examples illustrate the concepts developed. Finally, related branch-and-bound algorithms are studied using a...
-
作者：VANDIJK, NM
作者单位：Vrije Universiteit Amsterdam
摘要：State-space truncation is frequently demanded for computation of large or infinite Markov chains. Conditions are given that guarantee an error bound or rate of convergence. Roughly, these conditions apply either when probabilities of large states are sufficiently small, or when transition probabilities (rates) for state increases become small in sufficiently large states. The verification of these conditions is based on establishing bounds for bias terms of reward structures. The conditions an...
-
作者：BAJGIER, SM; MARAGAH, HD; SACCUCCI, MS; VERZILLI, A; PRYBUTOK, VR
作者单位：University of North Texas System; University of North Texas Denton; University of North Texas System; University of North Texas Denton
摘要：This paper describes a course taught in the College of Business and Administration at Drexel University in which students undertake real-world projects in an inner-city neighborhood. The course is an elective for students who have been exposed to the traditional techniques for problem solving in such courses as management science, operational research, statistics, organizational behavior, marketing, and economics. They address such public sector problems as people moving, traffic flow, trash r...
