On-line Scheduling with a Monotonous Subsequence Constraint
In this paper, we study a new on-line scheduling problem that each server has to process a monotonous request subsequence. The customer requests are released over-list, and the operator has to decide whether or not to accept the current request and arrange it to a server immediately. The goal of this paper is to find a strategy which accepts the maximal requests. When the number of servers k is less than that of the request types m, we give several lower bounds for this problem. Also, we present the optimal strategy for \( k=1 \) and \( k=2 \) respectively.
KeywordsScheduling On-line algorithm Competitive analysis Monotonous subsequence
This work was partially supported by the NSFC (Grant No. 71601152), and by the China Postdoctoral Science Foundation (Grant No. 2016M592811).
- 1.Zervas, G., Proserpio, D., Byers, J.: The rise of the sharing economy: estimating the impact of Airbnb on the hotel industry. 18 November 2016. Boston U. School of Management Research Paper No. 2013–2016Google Scholar
- 9.Nther, E., Maurer, O., Megow, N., et al.: A new approach to online scheduling: approximating the optimal competitive ratio. In: Twenty-Fourth ACM-SIAM Symposium on Discrete Algorithms, pp. 118–128. Society for Industrial and Applied Mathematics (2012)Google Scholar