Within the last year
Within the past 3 years
1 - 10 of 13 articles
The model in this paper is intended to explain the choice of transport made by shippers, as well as their total demand for transportation services. The optimal choice of mode is shown to involve a trade-off among freight rates, speed, dependability (variance in speed) and en-route lossage. It is...
The stochastic cash balance problem is an inventory problem in which the stochastic cash (or inventory) change can either be positive or nonpositive, and in which decisions to increase or decrease the inventory are permitted at the beginning of each time period. The paper studies problems in...
The first step in model-building is to note some simple observable patterns and to establish their degree of empirical generalisation. The second step is to integrate different empirical relationships of this kind. This is where the more complex mathematical models come in. Two examples of...
Experimental designs have found widespread application in the biological and physical sciences. The purpose in using these designs is not only that they are economical in terms of the number of experimental trials required, but more importantly, they provide a structure for the investigator's...
This paper presents a grouping procedure which yields improved solutions to Bomberger's Lot Size Scheduling Problem (1). The group definition is a generalization of the group definition proposed by Stankard and Gupta (3). Moreover, the generalization leads to a pseudo dynamic programming...
A study is made of a dynamic inventory model with stochastic lead times. A probability model is developed for the arrival of outstanding orders in which it is assumed that orders do not cross in time and that the arrival probabilities are independent of the number and size of outstanding orders....
The paper presents a new approach to solving a class of combinatorial economic allocation problems. One member of this class is known as the quadratic assignment problem. Besides presenting an algorithm to solve this problem, we will discuss in general terms the techniques for treating...
The steady state solution of the queue M / E k / r presented in a previous article (2) is amended. A simpler method of finding the basis set of state probabilities and a simpler form of the generating function for the state probabilities are derived.
The decomposition of a finite partially ordered set of elements as a union of chains was considered by Dilworth (2). Dantzig and Hoffman (1) formulated this problem as a linear programming problem and obtained Dilworth's theorem from duality theory. For some practical applications and for a...
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.