Skip to main content
SpringerLink
Log in

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We design a fully polynomial-time approximation scheme (FPTAS) for a knapsack problem to minimize a symmetric quadratic function. We demonstrate how the designed FPTAS can be adopted for several single machine scheduling problems to minimize the sum of the weighted completion times. The applications presented in this paper include problems with a single machine non-availability interval (for both the non-resumable and the resumable scenarios) and a problem of planning a single machine maintenance period; the latter problem is closely related to a single machine scheduling problem with two competing agents. The running time of each presented FPTAS is strongly polynomial.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time scheduling with a single breakdown. Acta Inf. 26, 679–696 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229–242 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Badics, T., Boros, E.: Minimization of half-products. Math. Oper. Res. 33, 649–660 (1998)

    Article  MathSciNet  Google Scholar 

  4. Breit, J., Schmidt, G., Strusevich, V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Method. Oper. Res. 57, 217–234 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kacem, I., Chu, C.: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur. J. Oper. Res. 187, 1080–1089 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Janiak, A., Kovalyov, M.Y., Kubiak, W., Werner, F.: Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165, 416–422 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)

    MATH  Google Scholar 

  8. Kovalyov, M.Y., Kubiak, W.: A fully polynomial approximation scheme for weighted earliness-tardiness problem. Oper. Res. 47, 757–761 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kubiak, W.: New results on the completion time variance minimization. Discrete Appl. Math. 58, 157–168 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kubiak, W.: Minimization of ordered, symmetric half-products. Discrete Appl. Math. 146, 287–300 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lee, C.-Y.: Machine scheduling with an availability constraint. J. Glob. Optim. 9, 395–416 (1996)

    Article  MATH  Google Scholar 

  12. Lee, C.-Y.: Machine scheduling with availability constraints. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 22-1–22-13. Chapman & Hall/CRC, London (2004)

    Google Scholar 

  13. Lee, C.-Y., Liman, S.D.: Single machine flow time scheduling with scheduled maintenance. Acta Inf. 29, 375–382 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pisinger, D.: The quadratic knapsack problem—a survey. Discrete Appl. Math. 155, 623–648 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sadfi, C., Penz, B., Rapin, C., Błažewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur. J. Oper. Res. 161, 3–10 (2005)

    Article  MATH  Google Scholar 

  16. Smith, W.E.: Various optimizers for single stage production. Nav. Res. Logist. Q 3, 59–66 (1956)

    Article  Google Scholar 

  17. Wang, G., Sun, H., Chu, C.: Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann. Oper. Res. 133, 183–192 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS J. Comput. 12, 57–75 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Woeginger, G.J.: Private communication (2005)

Download references

Author information

Authors and Affiliations

  1. Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15, 8010, Graz, Austria

    Hans Kellerer

  2. School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London, SE10 9LS, UK

    Vitaly A. Strusevich

Authors
  1. Hans Kellerer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vitaly A. Strusevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hans Kellerer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kellerer, H., Strusevich, V.A. Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57, 769–795 (2010). https://doi.org/10.1007/s00453-008-9248-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9248-1

Keywords

Search

Navigation