| Article ID: | iaor1995317 |
| Country: | Netherlands |
| Volume: | 14 |
| Issue: | 4 |
| Start Page Number: | 231 |
| End Page Number: | 235 |
| Publication Date: | Nov 1993 |
| Journal: | Operations Research Letters |
| Authors: | Preater J. |
| Keywords: | heuristics |
The paper considers a generalization of the classical secretary problem, in which an employer seeks to appoint a senior and a junior secretary from a sequence of candidates interviewed in random order. Analysis of dynamic programming recursions yields in optimal selection policy of threshold form.