## Abstract

The sequential stochastic assignment problem (SSAP) allocates N workers to N IID sequentially arriving tasks so as to maximize the expected total reward. This paper studies two extensions of the SSAP. The first one assumes that the values of any two consecutive tasks are dependent on each other while the exact number of tasks to arrive is unknown until after the final arrival. The second extension generalizes the first one by assuming that the number of workers is also random. Optimal assignment policies for both problems are derived and proven to have the same threshold structure as the optimal policy of the SSAP.

Original language | English (US) |
---|---|

Pages (from-to) | 317-340 |

Number of pages | 24 |

Journal | Mathematical Methods of Operations Research |

Volume | 82 |

Issue number | 3 |

DOIs | |

State | Published - Dec 1 2015 |

## Keywords

- Dynamic programming
- Markov processes
- Sequential assignment
- Stochastic processes

## ASJC Scopus subject areas

- Software
- General Mathematics
- Management Science and Operations Research