一个组面试问题的最佳顺序安排  

The Optimal Ordering of one Group Interview Problem

作　　者：刘欣[1] 孙平[2] 吴剑[2] 

机构地区：[1]沈阳化工学院数理系,辽宁沈阳110142 [2]东北大学数学系,辽宁沈阳110004

出　　处：《数学的实践与认识》2008年第16期76-79,共4页Mathematics in Practice and Theory

摘　　要：采用边界阶段方法讨论最优组面试问题的最佳划分选择策略,在允许调整面试顺序的情况下,得到最优组面试问题中如何重新安排面试顺序能够以最大概率录用到最优应聘者的排序策略.The paper discusses the optimal selection rule called the optimal partitioning strategy for the group interview problem in selecting the best choice by backward induction and boundary stage method. For the case where the decision maker is permitted to rearrange the sequence in action set A, the paper develops a simple heuristic procedure to the optimal ordering problem of the group interview problem in selecting the best choice.

关 键 词：组面试问题 最佳排序 边界阶段方法 

分 类 号：O223[理学—运筹学与控制论]