Abstract
This paper studies an online scheduling problem with increasing subsequence serving constraint. Customers requests are released over-list, and the operator has to decide whether or not to accept current request and arrange it to a server immediately. Each server has to process an increasing subsequence requests. There are two online scheduling problems in this paper. The first problem is to find a schedule which occupies the minimal servers if the operator accepts all requests. The second problem is to find a schedule which accepts the maximal requests if the operator has just one server. In this paper, we propose two optimal algorithms, Double-Greedy Algorithm and Partition Algorithm, for the above two problems, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Howell, G.A.: What is lean construction. In: Proceedings IGLC (1999)
Moodie, D.R.: Due date demand management: negotiating the trade-off between price and delivery. Int. J. Prod. Res. 37(5), 997–1021 (1999)
Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper. Res. 39(5), 836–846 (1991)
Portougal, V., Trietsch, D.: Setting due dates in a stochastic single machine environment. Comput. Oper. Res. 33(6), 1681–1694 (2006)
Kaminsky, P., Lee, Z.H.: Effective on-line algorithms for reliable due date quotation and large-scale scheduling. J. Sched. 11(3), 187–204 (2008)
Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math. 11(1), 29–35 (1975)
Albert, M.H., Golynski, A., Hamel, A.M., et al.: Longest increasing subsequences in sliding windows. Theor. Comput. Sci. 321(2), 405–414 (2004)
Deorowicz, S.: An algorithm for solving the longest increasing circular subsequence problem. Inf. Process. Lett. 109(12), 630–634 (2009)
Odlyzko, A.M., Rains, E.M.: On longest increasing subsequences in random permutations. Contemp. Math. 251, 439–452 (2000)
Arlotto, A., Gans, N., Steele, J.M.: Markov decision problems where means bound variances. Oper. Res. 62(4), 864–875 (2014)
Romik, D.: The Surprising Mathematics of Longest Increasing Subsequences. Cambridge University Press, Cambridge (2015)
Arlotto, A., Nguyen, V.V., Steele, J.M.: Optimal online selection of a monotone subsequence: a central limit theorem. Stochast. Process. Appl. 125, 3596–3622 (2015)
Nagarajan, V., Sviridenko, M.: Tight bounds for permutation flow shop scheduling. Math. Oper. Res. 34(2), 417–427 (2009)
Ausiello, G., Feuerstein, E., Leonardi, S., et al.: Algorithms for the on-line travelling salesman 1. Algorithmica 29(4), 560–581 (2001)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Acknowledgments
This research is partially supported by the NSFC (grant number 61221063), and by the PCSIRT (grant number IRT1173) and by China Postdoctoral Science Foundation(grant numbers 2014M550503 and 2015T81040).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Luo, K., Xu, Y., Feng, X. (2016). Online Scheduling with Increasing Subsequence Serving Constraint. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-39817-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39816-7
Online ISBN: 978-3-319-39817-4
eBook Packages: Computer ScienceComputer Science (R0)