A sequential scheduling problem with impatient jobs |
| |
| Authors: | Sheldon M. Ross |
| |
| Affiliation: | Department of Industrial and Systems Engineering, University of Southern, California, Los Angeles, California |
| |
| Abstract: | 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 |
| |
| Keywords: | stochastic scheduling list policy sufficient conditions for optimality simulation analysis heuristic policies |
|
|
