Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
In the paper a sequential assignment problem is discussed. There are n men with values, or efficiencies, Psub 1 or , ..., or psub n, and these men must be paired with n jobs which come in sequentially. The values of the jobs are Xsub 1,...,Xsub n, assumed to be independent, identically distributed random variables with a known distribution function F. It is assumed that if a p man is assigned to an x job, a reward of px is obtained. Author
- Administration and Management
- Operations Research