Accession Number:

AD0742764

Title:

Stochastic Sequential Assignment Problems.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH

Personal Author(s):

Report Date:

1972-04-27

Pagination or Media Count:

195.0

Abstract:

In the paper men with fixed values p1or...orpn are to be assigned to jobs. The jobs arrive sequentially and assume values x1, x2, ... , which are random variables. When a job arrives, its value is observed, a man is assigned to it, and a reward rp,x, usually px, is received. Various models are treated Exactly n jobs are arriving, but the xs may not be i.i.d. and not all of the men can do all of the jobs The number of jobs and the times they arrive are random, and not all of the jobs have to be used Men can finish jobs and then become reavailable Random replacements for assigned men are immediately available. Under the reward structure rp,x px, simple critical number policies, independent of the ps, are found which maximize the expected total reward or reward per unit time. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE