Operations Research

最新文章

• Allocation of chips to wafers in a production problem of semiconductor kits AI翻译
  作者：Seshadri, S; Shanthikumar, JG
  作者单位：University of California System; University of California Berkeley
  摘要：The problem of maximizing the production of good sets of semiconductor chips under random yield is reexamined in this paper. (A set of semiconductor chips is called a semiconductor kit.) This problem has been considered by Avram and Wein (1992) and Singh et al. (1988). To solve this problem we show that under certain combinations of assumptions the production process can be replaced by a black box The use of the black box model considerably simplifies the analysis and reduces the simulation ef...
• A time window approach to simultaneous scheduling of machines and material handling system in an FMS (vol 43, pg 1058, 1995) AI翻译
  作者：Bilge, U; Ulusoy, G
• Managing capacity and flow at theme parks AI翻译
  作者：Ahmadi, RH
  摘要：The growth of service industries and their impact on the U.S. economy have attracted considerable attention in recent years. While some service sectors, most notably airline and telecommunication industries, have been in the forefront of model development, the industry is rather fragmented, and similar rigor is lacking in most other sectors. This paper describes an application of a model-based approach to some of the short-term ride capacity and visitor flow issues faced by the Six Flags Magic...
• A Markov chain approach to baseball AI翻译
  作者：Bukiet, B; Harold, ER; Palacios, JL
  作者单位：Simon Bolivar University
  摘要：Most earlier mathematical studies of baseball required particular models for advancing runners based on a small set of offensive possibilities. Other efforts considered only teams viith players of identical ability. We introduce a Markov chain method that considers teams made up of players with different abilities and which is not restricted to a given model for runner advancement. Our method is limited only by the available data and can use any reasonable deterministic model for runner advanc...
• A multiproduct dynamic pricing problem and its applications to network yield management AI翻译
  作者：Gallego, G; VanRyzin, G
  作者单位：Columbia University
  摘要：A firm has inventories of a set of components that are used to produce: a set of products. There is a finite: horizon over which the firm can sell its products. Demand for each product is a stochastic point process with an intensity that is a function of the vector of prices for the products and the time at which these prices are offered. The problem is to price the finished products so as to maximize tot al expected revenue over the finite sales horizon. An upper bound on the optimal expected...
• Optimal dynamic scheduling policy for a make-to-stock production system AI翻译
  作者：Ha, AY
  摘要：This paper considers the dynamic scheduling problem of a single-server, make-to-stock queue with two products. For the case of Poisson demands and exponential production times, we show that it is optimal to produce the product with the larger b mu index when it is backordered. Lf the production times are identically distributed, the optimal policy can further be characterized by monotone switching curves. We also prove that a base stock policy coupled with a switching curve is optimal for some...
• The competitive newsboy AI翻译
  作者：Lippman, SA; McCardle, KF
  作者单位：Duke University
  摘要：We consider a competitive Version of the classical newsboy problem-in which a firm must choose ail inventory or production level for a perishable good with random demand, and the optimal solution is a fractile of the demand distribution-and investigate the impact of competition upon industry inventory. A splitting rule specifies how initial industry demand is allocated among competing firms and how any excess demand is allocated among firms with remaining inventory. We examine the relation bet...
• Single machine scheduling problems with general breakdowns, earliness and tardiness costs AI翻译
  作者：Federgruen, A; Mosheiov, G
  作者单位：Hebrew University of Jerusalem
  摘要：In this paper we consider single machine scheduling problems with a common due-date for all jobs, arbitrary monotone earliness and tardiness costs and arbitrary breakdown and repair processes. We show that the problem is equivalent to a deterministic one without breakdowns and repairs and with an equivalent cost function of a Sob's completion time. A V-shaped schedule without idle times is shown to be optimal, if this equivalent cost function is quasi-convex. Conversely, we show that a V-shape...
• Performance measures and schedules in periodic job shops AI翻译
  作者：Lee, TE; Posner, ME
  作者单位：University System of Ohio; Ohio State University
  摘要：This paper discusses the periodic job shop scheduling problem, a problem where an identical mixture of items, called a minimal part set (MPS), is repetitively produced. The performance and behavior of schedules are discussed. Two basic performance measures, cycle time and makespan, are shown to be closely related. The minimum cycle time is identified as a circuit measure in a directed graph. We establish that there exists a class of schedules that minimizes cycle time and repeats an identical ...
• A genetic algorithm for the multiple-choice integer program AI翻译
  作者：BenHadjAlouane, A; Bean, JC
  摘要：We present a genetic algorithm for the multiple-choice integer program that finds an optimal solution with probability one (though it is typically used as a heuristic). General constraints are relaxed by a nonlinear penalty function for which the corresponding dual problem has weak and strong duality. The relaxed problem is attacked by a genetic algorithm with solution representation special to the multiple-choice structure. Nontraditional reproduction, crossover and mutation operations are em...