Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications
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.
KeywordsQuadratic knapsack Single machine scheduling Total weighted completion time Availability constraints Scheduling agents FPTAS
Unable to display preview. Download preview PDF.
- 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
- 19.Woeginger, G.J.: Private communication (2005) Google Scholar