Dynamic sorting of entries in systems with a limited time of stay

A service discipline is proposed for systems with a limited time of stay whereby the entiries in a queue are sorted dynamically. With the system functioning until the first loss of an entry this discipline is shown to be optimal. Results of experimental testing of this discipline are given.