2000

最新文章

• Optimal policies for multi-echelon inventory problems with batch ordering AI翻译
  作者：Chen, FR
  作者单位：Columbia University
  摘要：In many production/distribution systems, materials Row from one stage to another in fixed lot sizes. For example, a retailer orders a full truckload from a manufacturer to qualify for a quantity discount; a factory has a material handling system that moves full containers of parts from one production stage to the next. In this paper, we derive optimal policies for multi-stage serial and assembly systems where materials flow in fixed batches. The optimal policies have a simple structure, and th...
• Nested partitions method for global optimization AI翻译
  作者：Shi, LY; Olafsson, S
  作者单位：University of Wisconsin System; University of Wisconsin Madison; Iowa State University
  摘要：We propose a new randomized method for solving global optimization problems. This method, the Nested Partitions (NP) method, systematically partitions the feasible region and concentrates the search in regions that are the most promising, The most promising region is selected in each iteration based on information obtained from random sampling of the entire feasible region and local search. The method hence combines global and local search. We first develop the method for discrete problems and...
• Adjustment strategies for a fixed delivery contract AI翻译
  作者：Moinzadeh, K; Nahmias, S
  作者单位：University of Washington; University of Washington Seattle; Santa Clara University
  摘要：We consider a long term contractual agreement between buyer and seller in which Q units are delivered to the buyer at regular time intervals. It must be true that the delivery quantity, Q, is less than the mean demand per period. In order to manage the inventory, the buyer has the option of adjusting the delivery quantity upwards just prior to a delivery, but must pay a premium to do so. Demand is assumed random. and we model the system in a continuous review setting. We show that the equation...
• Marketable pollution permits in oligopolistic markets with transaction costs AI翻译
  作者：Nagurney, A; Dhanda, KK
  作者单位：University of Massachusetts System; University of Massachusetts Amherst; University of Portland
  摘要：In this paper, we present a variational inequality framework for the modeling, qualitative analysis, and computation of equilibrium patterns in multiproduct, multipollutant oligopolistic markets with marketable pollution permits in the presence of transaction costs. The model deals explicitly with spatial differentiation and also guarantees that the imposed environmental quality standards are met through the initial allocation of licenses. An algorithm is proposed, with convergence results, to...
• Adaptive ordering and pricing for perishable products AI翻译
  作者：Burnetas, AN; Smith, CE
  作者单位：University System of Ohio; Case Western Reserve University
  摘要：We consider the combined problem of pricing and ordering for a perishable product with unknown demand distribution and censored demand observations resulting from lost sales, faced by a monopolistic retailer. We develop an adaptive pricing and ordering policy with the asymptotic property that the average realized profit per period converges with probability one to the optimal value under complete information on the distribution. The pricing mechanism is modeled as a multiarmed bandit problem, ...
• Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem AI翻译
  作者：Brimberg, J; Hansen, P; Mladenovic, N; Taillard, ED
  作者单位：University of Prince Edward Island; Universite de Montreal; Universite de Montreal; HEC Montreal; Universita della Svizzera Italiana
  摘要：The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Coope...
• A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem AI翻译
  作者：Holmberg, K; Yuan, D
  作者单位：Linkoping University
  摘要：The capacitated network design problem is a multicommodity minimal cost network Row problem with fixed charges on the arcs and is well known to be NP-hard. The problem type is very common in the context of transportation networks, telecommunication networks, etc. In this paper we propose an efficient method for this problem, based on a Lagrangian heuristic within a branch-and-bound framework. The Lagrangian heuristic uses a Lagrangian relaxation to obtain easily solved subproblems and solves t...
• Scheduling of multi-class single-server queues under nontraditional performance measures AI翻译
  作者：Ayhan, H; Olsen, TL
  作者单位：University System of Georgia; Georgia Institute of Technology; University of Michigan System; University of Michigan
  摘要：We consider a multi-class production system without setups where many job classes share a single server. The traditional performance measure used for scheduling these systems is that of mean throughput time (i.e.. the time spent in the system). However, mean throughput time may not be the only measure of importance in real systems. In particular, throughput time variance and the outer percentiles of throughput time may be equally important. We present two heuristics for scheduling multi-class ...
• The multistage service facility start-up and capacity model AI翻译
  作者：Li, LD; Zhang, HT
  作者单位：Yale University; Hong Kong University of Science & Technology
  摘要：In service industries, operations are often split into the front office and the back room. The front office deals directly with customers, whereas the back room engages in manufacturing-like operations. While such an arrangement may enjoy many benefits including reduced customer participation and back room efficiency, it gives rise to the possibility of communication and coordination problems between the front office and the back room. To address such coordination problems, we work from one po...
• Pure strategy asymmetric rendezvous on the line with an unknown initial distance AI翻译
  作者：Alpern, S; Beck, A
  作者单位：University of London; London School Economics & Political Science; University of Wisconsin System; University of Wisconsin Madison
  摘要：Suppose two blind agents with unit speed are placed a distance H apart on an infinite line, and faced in random directions. Their initial distance H is picked from a distribution F with finite mean mu. We present a pair of rendezvous strategies which do not depend on the distribution F and ensure a meeting in expected time less than 5.514 mu. This improves the bound of 5.74 mu given by Baston and Gal. Furthermore, the bound we give is best possible for strategies of our type.