Competitive Algorithms for Due Date Scheduling

  • Nikhil Bansal
  • Ho-Leung Chan
  • Kirk Pruhs
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4596)

Abstract

We consider several online scheduling problems that arise when customers request make-to-order products from a company. At the time of the order, the company must quote a due date to the customer. To satisfy the customer, the company must produce the good by the due date. The company must have an online algorithm with two components: The first component sets the due dates, and the second component schedules the resulting jobs with the goal of meeting the due dates.

The most basic quality of service measure for a job is the quoted lead time, which is the difference between the due date and the release time. We first consider the basic problem of minimizing the average quoted lead time. We show that there is a (1 + ε)-speed \(O(\frac{\log k}{\epsilon})\)-competitive algorithm for this problem (here k is the ratio of the maximum work of a job to the minimum work of a job), and that this algorithm is essentially optimally competitive. This result extends to the case that each job has a weight and the objective is weighted quoted lead time.

We then introduce the following general setting: there is a non- increasing profit function pi(t) associated with each job Ji. If the customer for job Ji is quoted a due date of di, then the profit obtained from completing this job by its due date is pi(di). We consider the objective of maximizing profits. We show that if the company must finish each job by its due date, then there is no O(1)-speed poly-log-competitive algorithm. However, if the company can miss the due date of a job, at the cost of forgoing the profits from that job, then we show that there is a (1 + ε)-speed O(1 + 1/ε)-competitive algorithm, and that this algorithm is essentially optimally competitive.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D.: On-line scheduling in the presence of overload. In: Symposium on Foundations of Computer Science, pp. 100–110. IEEE Computer Society Press, Los Alamitos (1991)Google Scholar
  2. 2.
    Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.: Online weighted flow time and deadline scheduling. Journal of Discrete Algorithms 4(3), 339–352 (2006)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Fisher, M.: What is the right supply chain for your product. In: Harvard Business Review, pp. 105–116 (1997)Google Scholar
  4. 4.
    Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. JACM 47, 214–221 (2000)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Kaminsky, P., Hochbaum, D.: Due date quotation models and algorithms. In: Leung, J.Y-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis (chapter 20) CRC Press Inc. (2004)Google Scholar
  6. 6.
    Keskinocak, P., Ravi, R., Tayur, S.: Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Management Science 47(2), 264–279 (2001)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Joseph, Y-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press (2004)Google Scholar
  9. 9.
    Stalk, G.: Time — the next source of competitive advantage. In: Harvard Business Review, pp. 41–51 (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Nikhil Bansal
    • 1
  • Ho-Leung Chan
    • 2
  • Kirk Pruhs
    • 2
  1. 1.IBM T.J. Watson Research, P.O. Box 218, Yorktown Heights, NY 
  2. 2.Computer Science Department, University of Pittsburgh 

Personalised recommendations