-
作者:Balakrishnan, A; Geunes, J
作者单位:University of Texas System; University of Texas Austin; State University System of Florida; University of Florida
摘要:Responding to varying customer needs for product customization, quantities, or lead times requires increased manufacturing flexibility. In certain contexts, the reverse is true, i.e., customer requirements are somewhat flexible, providing additional options in production planning. This paper considers such an opportunity faced by a specialty steel manufacturer whose customers allow flexibility in product specifications. We develop and test a model and solution methodology to exploit this flexi...
-
作者:Van Mieghem, JA
作者单位:Northwestern University
摘要:Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due-date t+D-k. Equivalently, its delay tau(k) must not exceed a given delay or lead-time D-k. In a stochastic system, the constraint tau(k) less than or equal to D-k must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, however, the associated optimal control problem is intractable. wit...
-
作者:Dai, JG; Li, CW
作者单位:University System of Georgia; Georgia Institute of Technology; Oracle
摘要:In a batch-processing network, multiple jobs can be formed into a batch to be processed in a single service operation. The network is multiclass in that several job classes may be processed at a server. Jobs in different classes cannot be mixed into a single batch. A batch policy specifies which class of jobs is to be served next. Throughput of a batch-processing network depends on the batch policy used. When the maximum batch sizes are equal to one, the corresponding network is called a stand...
-
作者:Brumelle, S; Walczak, D
作者单位:University of British Columbia
摘要:When a customer requests a discount fare, the airline must decide whether to sell the seat at the requested discount or to hold the seat in hope that-a customer will, arrive later who will pay more. We model this situation for a single-leg flight with multiple fare classes and customers who arrive according to a semi-Markov process (possibly nonhomogeneous). These customers can request multiple seats (batch requests) and can be overbooked. Under certain conditions, we show that the value funct...
-
作者:Scheel, H; Scholtes, S
作者单位:Dortmund University of Technology; University of Cambridge
摘要:Data envelopment analysis (DEA) is a methodology that allows, in one way or other, the assignment of efficiency scores to members of a group of decision-making units. We call an efficiency measure continuous if small perturbations of the input-output data cause only small changes in the score. Continuity is a desirable property of an-efficiency measure, in particular in the presence of measurement tolerances. Continuity is also desirable from a,numerical point of view because the scores are co...
-
作者:Alp, O; Erkip, NK; Güllü, R
作者单位:University of Alberta; Middle East Technical University
摘要:We characterize optimal policies of a dynamic lot-sizing/vehicle-dispatching problem under dynamic deterministic demands and stochastic lead times. An essential feature of the problem is the structure of the ordering cost, where a fixed cost is incurred every time a batch is initiated (or a vehicle is hired) regardless of the portion of the batch (or vehicle) utilized. Moreover, for every unit of demand not satisfied on time, holding and backorder costs are incurred. Under mild assumptions we ...
-
作者:Ball, MO; Hoffman, R; Odoni, AR; Rifkin, R
作者单位:University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要:In this paper, we analyze a generalization of a classic network-flow model. The generalization involves the replacement of deterministic demand with stochastic demand: While this generalization destroys the original network structure, we show that the matrix underlying the stochastic model is dual network. Thus. the integer program associated with the stochastic model can be solved efficiently using network-flow or linear-programming techniques We also develop an application of this model to t...
-
作者:Arbib, C; Marinelli, F; Rossi, F; Di Iorio, F
作者单位:University of L'Aquila; University of L'Aquila
摘要:This paper presents a decision support tool for solving a cutting and reuse problem arising in a European plant devoted to the production of gear belts. In this production, rectangular pieces of rubberised nylon are cut using machines employing parallel blades, so as to obtain rectangular components of identical height and (possibly) different width. A component is then used to produce a set of belts with the same girth; but, if necessary, the girth required can also be obtained by sewing toge...
-
作者:Keeney, RL
作者单位:Duke University
摘要:Value trade-offs define how much must be gained in the achievement of one objective to compensate for a lesser achievement on a different objective. Value trade-offs that adequately express a decision maker's values are essential both for good decision making in multiple-objective contexts and for insightful analyses of multiple-objective decisions. This paper identifies and illustrates 12 important mistakes frequently made that limit one's ability to determine useful value trade-offs. It then...
-
作者:Camm, JD; Norman, SK; Polasky, S; Solow, AR
作者单位:University System of Ohio; University of Cincinnati; Northern Arizona University; University of Minnesota System; University of Minnesota Twin Cities; Woods Hole Oceanographic Institution
摘要:We analyze the problem of maximizing the expected number of species in a nature reserve network, subject to a constraint on the number of sites in the network, given probabilistic information about species occurrences. The problem is a nonlinear binary integer program that is NP-hard. We develop a linear integer programming approximation that may be solved with standard integer programming software. We compare the approximation with two other approaches, an expected greedy approach and a proba...