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

DOI10.1016/J.EJOR.2005.03.040MaRDI QIDQ2503101zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 September 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.03.040

zbMATH Keywords

job schedulingoptimal stopping rulesecretary problemsequential decision

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50)

Recommendations

• A ranking method for the assignment problem with multiple optimal solutions
• A unified approach for solving sequential selection problems
• Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
• scientific article; zbMATH DE number 1304767
• A generalization of the assignment problem, and its application to the rank aggregation problem
• scientific article; zbMATH DE number 6691960
• Optimal selection based on relative ranks of a sequence by ties
• An algorithm for ranking assignments using reoptimization
• On a class of purely sequential procedures with applications to estimation and ranking and selection problems
• On computing an optimal permutation of ranks for multiselection

Cites work

• A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems
• A Sequential Stochastic Assignment Problem
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• Optimal selection based on relative rank (the 'Secretary Problem')
• The Analytic Hierarchy Process—An Exposition
• The Secretary Problem and Its Extensions: A Review

Cited in

(4)

• scientific article; zbMATH DE number 6691960 (Why is no real title available?)
• scientific article; zbMATH DE number 5823899 (Why is no real title available?)
• Deciding kidney-offer admissibility dependent on patients' lifetime failure rate
• Optimal selection based on relative ranks of a sequence by ties

This page was built for publication: A rank-based approach to the sequential selection and assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503101)