-
作者：Anderson, EJ; Fekete, SP
作者单位：University of New South Wales Sydney; Technical University of Berlin
摘要：We consider rendezvous problems in which two players move on the plane and wish to cooperate to minimise their first meeting time. We begin by considering the case where both players are placed such that the vector difference is chosen equiprobably from a finite set. We also consider a situation in which they know they are a distance d apart, but they do not know the direction of the other player. Finally, we give some results for the case in which player 1 knows the initial position of player...
-
作者：Bertsimas, D; Paschalidis, IC
作者单位：Massachusetts Institute of Technology (MIT); Boston University
摘要：We consider a model of a multiclass make-to-stock manufacturing system. External demand for each product class is met from the available finished goods inventory; unsatisfied demand is backlogged. The objective is to devise a production policy that minimizes inventory costs subject to guaranteeing stockout probabilities to stay bounded above by given constants epsilon (j), for each product class j (service level guarantees). Such a policy determines whether the facility should be producing (id...
-
作者：Hall, NG; Lesaoana, M; Potts, CN
作者单位：University System of Ohio; Ohio State University; University of Southampton
摘要：In most classical scheduling models, it is assumed that a job is dispatched to a customer immediately after its processing completes. In many practical situations, however, a set of delivery dates may be fixed before any jobs are processed. This is particularly relevant where delivery is an expensive or complicated operation, for example, as with heavy machinery. A similar situation arises where customers find deliveries disruptive and thus require them to be made within a limited time interva...
-
作者：Drekic, S; Stanford, DA
作者单位：University of Waterloo; Western University (University of Western Ontario)
摘要：The classical model of the preemptive repeat priority queue assumes that there is a single distribution from which service times for a given class are selected, regardless of the number of preemptions. This paper presents three alternatives for improving service progressively to preempted customers: (1) changing the service distribution, (2) preventing further preemptions, and (3) promoting customers to the next higher priority class. The Laplace-Stieltjes transform of the flow time distributi...
-
作者：Sobel, MJ; Zhang, RQ
作者单位：University System of Ohio; Case Western Reserve University; Cornell University
摘要：We consider a periodic review inventory system with demand arriving simultaneously from a deterministic source and a random source. The deterministic demand has to be satisfied immediately and the stochastic demand can be backordered. Assuming that the stochastic demand is never backlogged if there is stock in the system, we prove that a modified (s, S) policy is optimal under general conditions if there is a setup cost. If then is a smoothing cost instead of the setup cost, we observe that th...
-
作者：Henz, M
作者单位：National University of Singapore
摘要：Nemhauser and Trick presented the problem of finding a timetable for the 1997/1998 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sports tournament scheduling. This paper presents a solution of round-robin tournament planning based on finite-do...
-
作者：Carrizosa, E; Romero-Morales, D
作者单位：University of Sevilla; Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam; University of Sevilla
摘要：A number of methods for multiple-objective optimization problems (MOP) give as solution to MOP the set of optimal solutions for some single-objective optimization problems associated with it. Well-known examples of these single-objective optimization problems are the minsum and the minmax. In this note, we propose a new parametric single-objective optimization problem associated with MOP by means of Goal Programming ideas. We show that. the minsum and minmax are particular instances, so we are...
-
作者：Lougee-Heimer, R
作者单位：International Business Machines (IBM); IBM USA
摘要：We examine two coefficient adjustment methods proposed in the literature, and we show by example that the second is not valid. We provide a modified approach that subsumes both methods, generalizing the first and correcting the second.
-
作者：Bartholdi, JJ; Gue, KR
作者单位：University System of Georgia; Georgia Institute of Technology; United States Department of Defense; United States Navy; Naval Postgraduate School
摘要：Handling freight in a crossdocking terminal is labor intensive and therefore costly because workers must unload sort, and transfer a wide variety of freight from incoming to outgoing trailers. The efficiency of workers depends in large part on how trailers are assigned to doors around the dock; that is, on its layout. A good layout reduces travel distances without creating congestion, but until now no tools have been available to construct such layouts. We describe models of travel cost and th...
-
作者：Barnett, A
作者单位：Massachusetts Institute of Technology (MIT)
摘要：Under present arrangements, U.S. commercial planes do not travel as the crow flies from origin to destination; rather, they are generally restricted to paths within a grid. New technologies, however, raise the possibility of moving to a free-flight regime under which planes could fly directly from point to point. Striving for general insight rather than definitive conclusions, we use geometrical probability to assess how free-flight could affect the safety and efficiency of en route air traffi...
