The Relative Worst Order Ratio Applied to Seat Reservation

The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for this problem is studied using the relative worst order ratio, a fairly new measure for the quality of online algorithms, which allows for direct comparisons between algorithms. This study has yielded new separations between algorithms. For example, for both variants of the problem considered, using the relative worst order ratio, First-Fit and Best-Fit are shown to be better than Worst-Fit. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms: Algorithms Additional Key Words and Phrases: Online, quality measure, relative worst order ratio, seat reservation ACM Reference Format: Boyar, J. and Medvedev, P. 2008. The relative worst order ratio applied to seat reservation. ACM Trans. Algor. 4, 4, Ar...

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Joan Boyar, Paul Medvedev
• Keywords: Algorithms, Relative Worst Order, Seat Reservation, SWAT 2004, Worst Order Ratio