-
作者：BITRAN, GR; GILBERT, SM
作者单位：University System of Ohio; Case Western Reserve University
摘要：A wide variety of manufacturing operations can be characterized as co-production with substitutable demand. That is, there are many situations in which the availability of two or more items are related, and because of randomness in either supply or demand, it can be advantageous to substitute one of these items for another. Our research was motivated by the semiconductor industry, where chips are produced in large batches. Because of the presence of randomness in the process, individual chips ...
-
作者：DEMATTA, R; GUIGNARD, M
作者单位：University of Pennsylvania
摘要：Capacity-oriented production scheduling can be described as the assignment of competing products to several single level, capacitated production lines over a given planning horizon. This study was initially motivated by the production planning of various types of tiles by a tile manufacturing company. We considered different integer programming formulations and found that a disaggregated model, while increasing the size of the model, lends itself best to Lagrangian techniques and produces the ...
-
作者：DANIELS, RL; MAZZOLA, JB
作者单位：Duke University
摘要：This paper explores the improvements in manufacturing efficiency that can be achieved by broadening the scope of production scheduling to include both the sequencing of work and the coordination of the resource inputs required to perform work. Recognizing that some resources are inherently flexible and thus can be reassigned dynamically to processing centers as needed, and that job processing times are often a function of the amount of resource dedicated to specific operations, we formulate th...
-
作者：FRENK, H; LABBE, M; VANVLIET, M; ZHANG, SZ
作者单位：Universite Libre de Bruxelles
摘要：In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 3/2, respectively. The machine allocation problem we consider is a general convex resource allocation problem, which makes the algorithms applicable to a variety of resource allocation problems. Numerical results are presented for two real-life manufacturing systems.
-
作者：CALVIN, J
摘要：An important parameter of the regenerative method of simulation output analysis is the choice of return state used for blocking observations. Computational experience has shown that the statistical properties of estimators based on different regeneration points can vary widely. In this paper we study the limiting joint distribution of the normalized regenerative point and standard-deviation estimators for general state-space Markov chains. The asymptotic covariance between the point and standa...
-
作者：LAPORTE, G; LOUVEAUX, FV; MERCURE, H
作者单位：Universite de Montreal; HEC Montreal
摘要：The probabilistic traveling salesman problem (PTSP) is defined on a graph G = (V, E), where V is the vertex set and E is the edge set. Each vertex v(i) has a probability p(i) of being present. With each edge (v(i), v(j)) is associated a distance or cost c(ij). In a first stage, an a priori Hamiltonian tour on G is designed. The list of present vertices is then revealed. In a second stage, the a priori tour is followed by skipping the absent vertices. The PTSP consists of determining a first-st...
-
作者：DUPREEZ, JP
作者单位：Swansea University
摘要：In recent years various structures have been proposed for estimating intensity of consumer preference in consumer surveys. Empirical studies have shown intensity measures to be reliable and cost effective by providing more information per question. These structures use consumers' responses to determine whether the relevant preference function to be estimated is interval, ratio or ordinal in nature. This paper shows that the statistical tests to determine the nature of the preference function i...
-
作者：ANSTREICHER, KM; TERLAKY, T
作者单位：Delft University of Technology
摘要：We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost the pivot rule produces a sequence of pivots such that ultimately the originally chosen nonbasic variable enters the basis, and all reduced costs which were originally nonnegative remain nonnegative. The pivot rule thus monotonically builds up to a dual feasible, and hence optimal, basis. A surprising property is tha...
-
作者：ROUNDY, RO; SUN, DN
摘要：We show that an O(n3 log n) algorithm can find optimal power-of-two lot size policies for finite production rate assembly systems. This improves an O(n5) algorithm proposed in D. Atkins, M. Queyranne and D. Sun's 1992 paper.
-
作者：CURIEL, I; POTTERS, J; PRASAD, R; TIJS, S; VELTMAN, B
作者单位：Radboud University Nijmegen; Indian Statistical Institute; Indian Statistical Institute Bangalore; Tilburg University
摘要：In machine scheduling the first problem is to find a timetable that is optimal with respect to some efficiency criterion. If the jobs come from different clients the solution of the optimization problem is not the end of the story. In addition, we have to decide how the minimal total cost must be distributed among the parties involved. In this note, cost allocation problems will be considered to arise from one-machine scheduling problems with an additive and weakly increasing cost function. We...
