-
作者：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...
-
作者：Parija, G; Gadidov, R; Wilhelm, W
作者单位：International Business Machines (IBM); IBM USA; Texas A&M University System; Texas A&M University College Station
摘要：This paper presents the Facet Generation Procedure (FGP) for solving Oil integer programs. The FGP seeks to identify a hyperplane that represents a facet of an underlying polytope to cut off the fractional solution to the linear programming relaxation of the integer programming problem. A set of standard problems is used to provide insight into the computational characteristics of the procedure.
