Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Raymond G Vickson"'
Autor:
William T Ziemba, Raymond G Vickson
A reprint of one of the classic volumes on portfolio theory and investment, this book has been used by the leading professors at universities such as Stanford, Berkeley, and Carnegie-Mellon. It contains five parts, each with a review of the literatur
Publikováno v:
Annals of Operations Research. 284:623-643
In this paper we discuss the problem of locating items within carousel bins in order to minimize the average carousel rotational distance per retrieval. We consider two cases: (1) a single two-dimensional carousel and (2) a group of two one-dimension
Autor:
Raymond G. Vickson, Elkafi Hassini
Publikováno v:
European Journal of Operational Research. 170:824-843
We consider a two-stage batch manufacturing process in which the first stage shifts out-of-control at iid exponential times after starting in control. To improve quality, a production batch at Stage 1 is subjected to lot streaming: it is divided into
Publikováno v:
Optimization Methods and Software. 19:165-178
One-operator two-machine open shop and flow shop problems are 𝒩𝒫-hard in the ordinary sense even if all the weights are the same. We discuss two different pseudo polynomial dynamic programming recursions for each of the open shop and flow shop
Autor:
Md. Fazle Baki, Raymond G. Vickson
Publikováno v:
INFOR: Information Systems and Operational Research. 41:301-319
This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After develop
Autor:
Raymond G. Vickson, Elkafi Hassini
Publikováno v:
Computers & Operations Research. 30:527-539
We describe a problem of storing products in carousels that are grouped in pods of two. Each pod is served by one operator. The aim is to minimize the long-run average rotational time per retrieval operation. We formulate the problem as a new type of
Publikováno v:
INFOR: Information Systems and Operational Research. 39:357-366
In this paper, we consider a single server queueing system with Poisson arrivals and multiple vacation types, in which the server can choose one of several types of vacations to take when he finishes serving all customers in the system. Upon completi
Autor:
Xinjian Lu, Raymond G. Vickson
Publikováno v:
European Journal of Operational Research. 105:18-28
This paper treats several problems of product storage and server locations in one-dimensional linear and circular storage racks under anticipatory operation of the retrieval unit. Simultaneous optima are obtained for the server's home base and the pr
Autor:
Raymond G. Vickson
Publikováno v:
IIE Transactions. 30:1019-1024
This paper analyzes a problem of optimal inspection intervals for a failure-prone batch production facility. The model makes a seemingly minor modification to similar models that have appeared recently, but which results in a significant change in th
Autor:
Raymond G. Vickson
Publikováno v:
Operations Research Letters. 20:243-247
A lot of N items is produced on a randomly degrading facility. The lot is split into inspection sublots for detection of faulty items, and the process is returned to as-new condition after each sublot. For exponentially distributed failure time the m