A Rank-Based Approach to the Sequential Selection and Assignment Problem

Document Type

Conference Proceeding

Publication Date

12-1-2002

Abstract

In the classical sequential assignment problem, "machines" are to be allocated to "jobs" so as to maximize the expected total return. The set of machines and their values are given ahead of time, but jobs arrive in sequential order and their values are usually treated as random variables from a known probability distribution with known parameter values. In the paper, we propose a rank- based sequential assignment strategy that does not depend on any distributional assumptions. We only assume that the decision-maker can rank the sequentially arriving jobs from best to worst without ties. Due to its distribution-free property, our rank-based assignment strategy can be successfully applied to many managerial decision problems such as machine scheduling, job interview, and kidney allocations for transplant.

Publication Source (Journal or Book title)

Proceedings Annual Meeting of the Decision Sciences Institute

First Page

1654

Last Page

1659

This document is currently not available here.

Share

COinS