Within the last year
Within the past 3 years
1 - 10 of 20 articles
This paper presents a method for computing the lot size to be produced each time each product is scheduled for production when all products are produced on a single machine. The method also computes the distribution of lot size for each product. The demand for each product is a stochastic...
We present a procedure for the economic design of Cusum charts to control the mean of a process with a normally distributed quality characteristic. A model is derived which gives the long-ran average cost as a function of both the design parameters of the chart and the cost and risk factors...
The n job, one-machine scheduling problem is considered where set-up and processing times are random and the objective is to minimize the number of late jobs. In the deterministic case, Moore's algorithm is known to produce an optimal schedule. A chance-constrained formulation of the...
Column dropping procedures are provided for the Generalized Programming algorithm. Nonbasic columns may not be dropped, however, from the restricted master at every iteration for all problems. Conditions are provided under which columns may be dropped from the restricted master. An example is...
A deterministic production planning problem with limited backlogging, inventory and production capacity constraints is considered. The model also includes a certain type of production cost function which is neither convex nor concave. A characterization of the extreme points is provided and an...
Burke (Burke, P. J. 1956. The output of a queueing system. Oper. Res. 4 699–704.) showed that the departure process from an M / M /1 queue with infinite capacity was in fact a Poisson process. Using methods from semi-Markov process theory, this paper extends this result by determining that the...
This paper deals with the problem of explaining the behavior of a producer entering the period with growing inventory, while the current price and a stochastic distribution of prices for the following period are given. The conceptual framework is one of searching for an optimal stopping rule for...
Consider a stockpile consisting of n items where the i th item has a rating r i , i = 1, …, n . An item with rating r , if kept in stockpile until time t and then released to the field, will have a field life of rd ( t ). Thus it is assumed that for any t , the field life for issuance at time t...
Comments and clarifications about paper (Wilbrecht, J. K., W. B. Prescott. 1969. The influence of setup time on job shop performance. Management Sci. 16 (4, December).).
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.