M. Babaioff, J. D. Hartline, and R. D. Kleinberg, Selling ad campaigns, Proceedings of the tenth ACM conference on Electronic commerce, EC '09, pp.61-70, 2009.
DOI : 10.1145/1566374.1566383

D. P. Bunde and M. H. Goldwasser, Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput, Proc. 12th Scandinavian Workshop on Algorithm Theory, pp.346-358, 2010.
DOI : 10.1007/978-3-642-13731-0_33

S. Chen, L. Tong, and T. He, Optimal deadline scheduling with commitment, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.111-118, 2011.
DOI : 10.1109/Allerton.2011.6120157

F. Y. Chin, M. Chrobak, S. P. Fung, W. Jawor, J. Sgall et al., Online competitive algorithms for maximizing weighted throughput of unit jobs, Journal of Discrete Algorithms, vol.4, issue.2, pp.255-276, 2006.
DOI : 10.1016/j.jda.2005.03.005

F. Y. Chin and S. P. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?, Algorithmica, vol.37, issue.3, pp.149-164, 2003.
DOI : 10.1007/s00453-003-1025-6

R. Cole, S. Dobzinski, and L. Fleischer, Prompt Mechanisms for Online Auctions, Proc. 1st Symposium on Algorithmic Game Theory, pp.170-181, 2008.
DOI : 10.1007/978-3-540-79309-0_16

F. Constantin, J. Feldman, S. Muthukrishnan, and M. Pal, An Online Mechanism for Ad Slot Reservations with Cancellations, Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1265-1274, 2009.
DOI : 10.1137/1.9781611973068.137

J. Ding, T. Ebenlendr, J. Sgall, and G. Zhang, Online Scheduling of Equal-Length Jobs on Parallel Machines, Proc. 15th European Symposium on Algorithms, pp.427-438, 2007.
DOI : 10.1007/978-3-540-75520-3_39

J. Ding and G. Zhang, Online Scheduling with Hard Deadlines on Parallel Machines, Proc. 2nd International Conference on Algorithmic Aspects in Information and Management, pp.32-42, 2006.
DOI : 10.1007/11775096_5

T. Ebenlendr and J. Sgall, A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines, Proc. 6th Workshop on Approximation and Online Algorithms, pp.43-52, 2008.
DOI : 10.1007/11785293_13

M. Englert and M. Westermann, Considering suppressed packets improves buffer management in QoS switches, Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, pp.209-218, 2007.

S. P. Fung, Online Preemptive Scheduling with Immediate Decision or Notification and Penalties, Proc. 16th International Computing and Combinatorics Conference, pp.389-398, 2010.
DOI : 10.1007/978-3-642-14031-0_42

M. H. Goldwasser, A survey of buffer management policies for packet switches, ACM SIGACT News, vol.41, issue.1, pp.100-128, 2010.
DOI : 10.1145/1753171.1753195

M. H. Goldwasser and B. Kerbikov, Admission control with immediate notification, Journal of Scheduling, vol.6, issue.3, pp.269-285, 2003.
DOI : 10.1023/A:1022956425198

B. Hajek, On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time, Proc. Conference on Information Sciences and Systems, pp.434-438, 2001.

P. Kaminsky and D. Hochbaum, Due date quotation models and algorithms. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 2004.

P. Keskinocak, R. Ravi, and S. Tayur, Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues, Management Science, vol.47, issue.2, pp.264-279, 2001.
DOI : 10.1287/mnsc.47.2.264.9836

A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-shamir, B. Schieber et al., Buffer overflow management in QoS switches, Proc. 33th ACM Symposium on Theory of Computing, pp.520-529, 2001.

K. Pruhs, J. Sgall, and E. Torng, Online Scheduling In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 15, 2004.

A. Zhu, Analysis of queueing policies in QoS switches, Journal of Algorithms, vol.53, issue.2, pp.137-168, 2004.
DOI : 10.1016/j.jalgor.2004.04.007