Within the last year
Within the past 3 years
1 - 10 of 16 articles
A strategy is determined which takes into account a player's skill, the score of the match, the value of the current game, and the possibility of winning a double-game (a gammon). The strategy described here has worked quite well in practice.
This paper reports computational experience in using a nested decomposition (staircase) algorithm to solve a version of Manne's linear programming model of U. S. energy options. Nested decomposition is found to be 28% to 52% faster than a direct simplex approach for our test problems. Effects of...
A previous study attempting to evaluate the benefits of coordination of marketing, production and finance decisions by Damon and Schramm is examined. It is noted that because of a flaw in the formulation of the marketing sector, the numerical results reported in this study are difficult to...
This paper describes the development and application of an optimization program that is used to help electric utilities plan investments for power generation. For each year over a planning horizon the program determines what types and sizes of generating plants should be constructed, so as to...
A quantitative comparison between three types of capacity planning or shop loading techniques is presented. The results were obtained from simulation experiments.
This paper extends work previously reported on storage assignment rules for automatic warehousing systems to include interleaving ; that is, the sequencing of storage and retrieve requests. Using both continuous analytical models and discrete evaluation procedures, this paper compares the...
For a seven-day's-a-week operation in which N employees are needed on each weekday and n on each weekend day, with N at least as large as n , the work stretch is developed for each of several different rest policies. The work stretch is the number of consecutive work days between rest days....
In this note we prove a conjecture of Rolfe concerning the convexity of the expected queueing time formula for an M / M / c queue.
This paper deals with a practical application of queueing theory. In particular, an approximate but quick method is developed for solving a fleet sizing and allocation problem. The problem concerns an optimal allocation of the total available transport vehicle units to many fleets in such a way...
This paper presents a heuristic technique for obtaining good solutions to large multicommodity network flow problems. The general approach is to allocate the arc capacities among the individual commodities and hence decompose the problem into a set of one-commodity problems. The one-commodity...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.