-
作者：Dahl, G; Martin, A; Stoer, M
作者单位：University of Oslo; Zuse Institute Berlin
摘要：We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0-1 variables represent different paths. An associated integral polytope is studied, and different classes of facets are described. These results are used in a cutting plane algorithm. Computational results for same realistic problems are reported.
-
作者：Shih, FR; Mazumdar, M; Bloom, JA
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; Electric Power Research Institute (EPRI)
摘要：The cost of producing electricity during a given time interval is a random variable that depends both on the availability of the generating units during the study horizon and on the magnitude of the load. Based upon a Markov model, we present a recursive scheme for estimating the asymptotic mean and variance of the production cost. These computations are difficult because the state space for a typical power generation system is very large and because the asymptotic variance depends upon the fu...
-
作者：Bollapragada, S; Morton, TE
作者单位：General Electric; Carnegie Mellon University
摘要：We consider a single item periodic review inventory problem with random yield and stochastic demand. The yield is proportional to the quantity ordered, with the multiplicative factor being a random variable. The demands are stochastic and are independent across the periods, but they need not be stationary. The holding, penalty, and ordering costs are linear. Any unsatisfied demands are backlogged. Two cases for the ordering cost are considered: The ordering cost can be proportional to either t...
-
作者：Shi, Y
作者单位：University of Nebraska System
摘要：This paper applies multicriteria de nova programming to formulate and solve problems of system design that involve multiple decision makers and a possible debt. In the framework of the system design model, each involved decision maker has his or her own preference for the budget availability level associated with multicriteria under consideration. If the possible debt occurs in the design time, the model allows flexibility for decision makers to borrow additional money from a bank with a fixed...
-
作者：Caprara, A; Fischetti, M; Toth, P
作者单位：University of Bologna; University of Padua
摘要：We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello State SpA. In 1994 Ferrovie dello State SpA, jointly with the Italian Operational Research Society, organized a competition, called FASTER, intended to promote the development of algorithms capable of pro...
-
作者：McCormick, ST
作者单位：University of British Columbia
摘要：Chen (1994) develops an attractive variant of the classical problem of preemptively scheduling independent jobs with release dates and due dates. Chen suggests that in practice one can often pay to reduce the processing requirement of a job. This leads to two parametric max flow problems. Serafini (1996) considers scheduling independent jobs with due dates on multiple machines, where jobs can be split among machines so that pieces of a single job can execute in parallel. Minimizing the maximum...
-
作者：Kovalyov, MY; Kubiak, W
作者单位：National Academy of Sciences of Belarus (NASB); United Institute of Informatics Problems of the National Academy of Sciences of Belarus; Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Communaute Universite Grenoble Alpes; Universite Grenoble Alpes (UGA)
摘要：A fully polynomial approximation scheme for the problem of scheduling n jobs on a single machine to minimize total weighted earliness and tardiness is presented. A new technique is used to develop the scheme. The main feature of this technique is that it recursively computes lower and upper bounds on the value of partial optimal solutions. Therefore, the scheme does not require any prior knowledge of lower and upper bounds on the value of a complete optimal solution. This distinguishes it from...
-
作者：Cheng, RCH; Kleijnen, JPC
作者单位：University of Southampton; Tilburg University
摘要：Simulation experiments for analysing the steady-state behaviour of queueing systems over a range of traffic intensities are considered, and a procedure is presented for improving their design. In such simulations the mean and variance of the response output can increase dramatically with traffic intensity; the design has to be able to cope with this complication. A regression metamodel of the likely mean response is used consisting of two factors, namely, a low-degree polynomial and a factor a...
-
作者：Jones, LK
作者单位：University of Massachusetts System; University of Massachusetts Lowell
摘要：Balking is the act of not joining a queue because the prospective arriving customer judges the queue to be too long. We analyze queues in the presence of balking, using only the service start and stop data utilized in Larson's Queue Inference Engine (Q.I.E.). Using an extension of Larson's congestion probability calculation to include balking we present new maximum likelihood, nonparametric, and Bayesian methods for inferring the arrival rate and balking functions. The methodology is applicabl...
-
作者：Adil, GK; Ghosh, JB
作者单位：University of Manitoba; Ihsan Dogramaci Bilkent University
摘要：Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations to obtain both heuristic solutions and lower bounds on optimal solution values. In this note, we point to certain inconsistencies in the reported results. Among other things, we show analytically that the first bound proposed is trivial (i.e., it can never have a value gr...
