Abstract
This paper considers several online scheduling problems that arise from companies with made-to-order products. Jobs, which are product requests, arrive online with different sizes and weights. A company needs to assign a due date for each job once it arrives, and complete the job by this due date. The (weighted) quoted lead time of a job equals its due date minus its arrival time, multiplied by its weight. We focus on companies that mainly rely on computers for production. In those companies, energy cost is a large concern. For most modern processors, its rate of energy usage equals s α, where s is the current speed and α> 1 is a constant. Hence, reducing the processing speed can reduce the rate of energy usage. Algorithms are needed to optimize the (weighted) quoted lead time (for better user experience) and the energy usage (for a smaller energy cost).
We propose an algorithm which is \(4 ( (\log k)^{\alpha-1} + \frac{\alpha}{\alpha-1})\)-competitive for minimizing the sum of the quoted lead time and energy usage, where k is the ratio between the maximum to minimum job density. Here, the density of a job equals its weight divided by its size. We also consider the setting where we may discard a job by paying a penalty, and the setting of scheduling on a multiprocessor. We propose competitive algorithms for both settings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S.: Energy-efficient algorithms. Communications ACM 53(5), 86–96 (2010)
Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms 3(4) (2007)
Andrew, L., Wierman, A., Tang, A.: Optimal speed scaling under arbitrary power functions. ACM SIGMETRICS Performance Evaluation Review 37(2), 39–41 (2009)
Bansal, N., Chan, H.-L., Pruhs, K.: Competitive algorithms for due date scheduling. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 28–39. Springer, Heidelberg (2007)
Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: SODA, pp. 693–701 (2009)
Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 805–813 (2007)
Belady, C.: In the data center, power and cooling costs more than the it equipment it supports. Electronics Cooling Magazine 13(1), 24–27 (2007), http://electronics-cooling.com/articles/2007/feb/a3/
Chan, S.-H., Lam, T.-W., Lee, L.-K.: Scheduling for weighted flow time and energy with rejection penalty. To appear in STACS 2011 (2011)
Fisher, M.: What is the right supply chain for your product. Harvard Business Review, 105–116 (March 1997)
Gupta, A., Krishnaswamy, R., Pruhs, K.: Scalably scheduling power-heterogeneous processors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 312–323. Springer, Heidelberg (2010)
Kaminsky, P., Hochbaum, D.: Due date quotation models and algorithms. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 20. CRC Press, Inc., Boca Raton (2004)
Keskinocak, P., Tayur, S.: Due date mangement policies. In: Simchi-Levi, D., Wu, S.D., Shen, Z.-J.M. (eds.) Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, pp. 485–554. Springer, Heidelberg (2004)
Stalk, G.: Time — the next source of competitive advantage. Harvard Business Review, 41–51 (July 1988)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Foundations of Computer Science (FOCS), pp. 374–382 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, HL., Lam, TW., Li, R. (2011). Energy-Efficient Due Date Scheduling. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)