On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost

  • Wiebke Höhn
  • Tobias Jacobs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7256)


We consider the problem of scheduling jobs on a single machine. Given some continuous cost function, we aim to compute a schedule minimizing the weighted total cost, where the cost of each individual job is determined by the cost function value at the job’s completion time. This problem is closely related to scheduling a single machine with nonuniform processing speed. We show that for piecewise linear cost functions it is strongly NP-hard.

The main contribution of this article is a tight analysis of the approximation factor of Smith’s rule under any particular convex or concave cost function. More specifically, for these wide classes of cost functions we reduce the task of determining a worst case problem instance to a continuous optimization problem, which can be solved by standard algebraic or numerical methods. For polynomial cost functions with positive coefficients it turns out that the tight approximation ratio can be calculated as the root of a univariate polynomial. To overcome unrealistic worst case instances, we also give tight bounds that are parameterized by the minimum, maximum, and total processing time.


Cost Function Completion Time Problem Instance Approximation Factor Total Processing Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Afrati, F.N., Bampis, E., Chekuri, C., Karger, D.R., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proc. of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 32–44 (1999)Google Scholar
  2. 2.
    Bansal, N., Pruhs, K.R.: Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service. SIAM Journal on Computing 39(7), 3311–3335 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Becchettia, L., Leonardia, S., Marchetti-Spaccamela, A., Pruhs, K.: Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4, 339–352 (2006)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cheung, M., Shmoys, D.B.: A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX/RANDOM 2011. LNCS, vol. 6845, pp. 135–146. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal Sequencing on a Single Machine. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 230–243. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5, 287–326 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Höhn, W., Jacobs, T.: An experimental and analytical study of order constraints for single machine scheduling with quadratic cost. In: Proc. of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX 2012). SIAM (to appear, 2012)Google Scholar
  8. 8.
    Jacobs, T.: Resistant algorithms: Obtaining simpler proofs by excluding corner cases. CoRR abs/0910.1387 (2009)Google Scholar
  9. 9.
    Mondal, S.A., Sen, A.K.: An improved precedence rule for single machine sequencing problems with quadratic penalty. Eur. J. Oper. Res. 125, 425–428 (2000)zbMATHCrossRefGoogle Scholar
  10. 10.
    Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59–66 (1956)CrossRefGoogle Scholar
  11. 11.
    Stiller, S., Wiese, A.: Increasing speed scheduling and flow scheduling. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 279–290. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Townsend, W.: The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage. Sci. 24, 530–534 (1978)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wiebke Höhn
    • 1
  • Tobias Jacobs
    • 2
  1. 1.Technische Universität BerlinGermany
  2. 2.NEC Laboratories EuropeHeidelbergGermany

Personalised recommendations