A sequential scheduling problem with impatient jobs
研究单个服务员如何选择下一个服务的顾客，以最大化总期望收益，其中每个顾客的等待时间服从指数分布，服务时间任意分布，且服务完成后获得正奖励。
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015