-
作者：Reisman, A; Kumar, A; Motwani, J; Cheng, CH
作者单位：Grand Valley State University; Chinese University of Hong Kong
摘要：This paper is both an extension and an expansion of two earlier studies concerned with the direction of OR/MS research as reported in its archival literature (Reisman and Kirschnick 1994, 1995). All of these papers provide a content analysis of the OR/MS archival journals. However, this paper focuses on the entire life-cycle literature of Cellular Manufacturing as a module of OR/MS. It addresses the research strategy employed by, and the theory-vs-applied orientation exhibited by, the authors....
-
作者：Betts, LM; Brown, JR
摘要：The proportional equity dow problem extends a class of problems referred to as equity flow problems whose objective is to equitably distribute dow among the arcs in a how circulation network. The proportionally bounded dow circulation problem places lower and upper bounds on each are flow that are nondecreasing continuous functions of the flow through one special are, and the objective is to maximize the flow through the special arc. The proportional equity dow problem for terminal arcs (Probl...
-
作者：Borst, SC; Boxma, OJ
摘要：We consider two different single-server cyclic polling models: (i) a model with zero switchover times, and (ii) a model with nonzero switchover times, in which the server keeps cycling when the system is empty. For both models we relate the steady-state queue length distribution at a queue to the queue length distributions at server visit beginning and visit completion instants at that queue; as a by-product we obtain a short proof of the Fuhrmann-Cooper decomposition. For the large class of p...
-
作者：Jurisch, B; Kubiak, W
作者单位：Memorial University Newfoundland
摘要：In open shops with renewable resources, an operation may require additional resources, besides a machine, for its execution. All resources required by the operation are allocated to it all the time during its execution. At no time may total resource requirements exceed resource capacities. We consider the problem of minimizing makespan in a two-machine open shop with a single renewable resource. We show that optimal nonpreemptive schedules are not longer than optimal preemptive schedules, whic...
-
作者：Lee, CY; Vairaktarakis, GL
作者单位：Marquette University
摘要：Serial assembly systems are formed by arranging several production cells or stations in series. We study a popular class of serial assembly lines where all stations have the same production cycle. We address a workforce planning problem for such lines which finds applications in labor-intensive operations in automobile, fire engine, aircraft, and PC board assembly. The problem presented can be applied to lines that produce several variations of a basic stable design; i.e., mixed model transfer...
-
作者：Gendreau, M; Laporte, G; Semet, F
摘要：The Covering Tour Problem (CTP) is defined on a graph G = (V boolean OR W, E), where W is a set of vertices that must be covered. The CTP consists of determining a minimum length Hamiltonian cycle on a subset of V such that every vertex of W is within a prespecified distance from the cycle. The problem is first formulated as an integer linear program, polyhedral properties of several classes of constraints are investigated, and an exact branch-and-cut algorithm is developed. A heuristic is als...
-
作者：Abboud, NE; Daigle, JN
作者单位：University of Mississippi
摘要：A set of identical machines are deployed to meet a known and constant demand. If a machine fails, a replacement part must be available before repair of the machine may be initiated. If the part is currently out of stock, it must be ordered. Once repaired at one of a finite number of repair stations, the machine serves as an ''operational ready'' standby if demand is currently being met; otherwise, the machine is immediately deployed. Machine time-to-failure, ordering leadtimes, and repair time...
-
作者：DauzerePeres, S; Lasserre, JB
作者单位：Centre National de la Recherche Scientifique (CNRS)
摘要：The issue in Lot Streaming is how to split lots into sublets in order to improve the makespan (or some other criterion). We present a model and an iterative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublets on the machines, and a standard job-shop scheduling problem with fixed sublet sizes. We report the computational results on a significant sample of 120 job-shop and Bow-shop scheduling problems (inclu...
-
作者：Federgruen, A; VanRyzin, G
摘要：We give a unified probabilistic analysis for a general class of bin packing problems by directly analyzing corresponding mathematical programs. In this general class of packing problems, objects are described by a given number of attribute values. (Some attributes may be discrete; others may be continuous.) Bins are sets of objects, and the collection of feasible bins is merely required to satisfy some general consistency properties. We characterize the asymptotic optimal value as the value of...
-
作者：Dai, JG; Yeh, DH; Zhou, C
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：This paper is concerned with the estimation of performance measures of two priority disciplines in a d-station re-entrant queueing network. Such networks arise from complex manufacturing systems such as wafer fabrication facilities. The priority disciplines considered are First-Buffer-First-Served (FBFS) and Last-Buffer-First-Served (LBFS). An analytical method is developed to estimate the long-run average workload at each station and the mean sojourn time in the network. When the first-buffer...
