A rank-based approach to the sequential selection and assignment problem

Citations of this article
Mendeley users who have this article in their library.
Get full text


In the classical sequential assignment problem, "machines" are to be allocated sequentially to "jobs" so as to maximize the expected total return, where the return from an allocation of job j to machine k is the product of the value xj of the job and the weight pk of the machine. The set of m machines and their weights are given ahead of time, but n jobs arrive in sequential order and their values are usually treated as independent, identically distributed random variables from a known univariate probability distribution with known parameter values. In the paper, we consider a rank-based version of the sequential selection and assignment problem that minimizes the sum of weighted ranks of jobs and machines. The so-called "secretary problem" is shown to be a special case of our sequential assignment problem (i.e., m = 1). Due to its distribution-free property, our rank-based assignment strategy can be successfully applied to various managerial decision problems such as machine scheduling, job interview, kidney allocations for transplant, and emergency evacuation plan of patients in a mass-casualty situation. © 2005 Elsevier B.V. All rights reserved.




Chun, Y. H., & Sumichrast, R. T. (2006). A rank-based approach to the sequential selection and assignment problem. European Journal of Operational Research, 174(2), 1338–1344. https://doi.org/10.1016/j.ejor.2005.03.040

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free