Abstract
In the global logistics market, agents need to decide upon whether to accept jobs offered sequentially. For each offer, an agent makes an immediate selection decision with little knowledge about future jobs; the goal is to maximize the profit. We study this online decision problem of acceptance of unit length jobs with time constraints, which involves online scheduling. We present theoretically optimal acceptance strategies for a fundamental case, and develop heuristic strategies in combination with an evolutionary algorithm for more general and complex cases. We show experimentally that in the fundamental case the performance of heuristic solutions is almost the same as that of theoretical solutions. In various settings, we compare the results achieved by our online solutions to those generated by the optimal offline solutions; the average-case performance ratios are about 1.1. We also analyze the impact of the ratio between the number of slots and the number of jobs on the difficulty of decisions and the performance of our solutions.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldwasser, M., Kerbikov, B.: Admission control with immediate notification. Journal of Scheduling 6(3), 269–285 (2003)
Garay, J., Naor, J., Yener, B., Zhao, P.: On-line admission control and packet scheduling with interleaving. In: Proc. of INFOCOM 2002, vol. 1, pp. 94–103. IEEE (2002)
Fung, S.P.Y.: Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 389–398. Springer, Heidelberg (2010)
Ford, L., Fulkerson, D.: Maximal flow through a network. Canadian Journal of Mathematics 8(3), 399–404 (1956)
Bosman, P.: On empirical memory design, faster selection of bayesian factorizations and parameter-free gaussian EDAs. In: Proc. of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 389–396. ACM (2009)
Kuhn, H.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2), 83–97 (1955)
Buehren, M.: Algorithms for the Assignment Problem (2009), http://www.markusbuehren.de
Kalyanasundaram, B., Pruhs, K.: On-line weighted matching. In: Proc. of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, p. 240. SIAM (1991)
Khuller Stephen, G., et al.: On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science 127(2), 255–267 (1994)
Ajtai, M., Megiddo, N., Waarts, O.: Improved algorithms and analysis for secretary problems and generalizations. In: Proc. of the 36th Annual Symposium on Foundations of Computer Science, pp. 473–482. IEEE (1995)
Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. ACM SIGecom Exchanges 7(2), 1–11 (2008)
Goldman, S.A., Parwatikar, J., Suri, S.: On-line Scheduling with Hard Deadlines. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 258–271. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, M., de Weerdt, M., La Poutré, H. (2013). Acceptance Strategies for Maximizing Agent Profits in Online Scheduling. In: David, E., Robu, V., Shehory, O., Stein, S., Symeonidis, A. (eds) Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. AMEC TADA 2011 2011. Lecture Notes in Business Information Processing, vol 119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34889-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34889-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34888-4
Online ISBN: 978-3-642-34889-1
eBook Packages: Computer ScienceComputer Science (R0)