Software release planning in software development is to assign its features to releases in a specified planning horizon,satisfying technology, resource, risk, and budget constraints. The release planning problembecomes more complicated when the concept of software product lines (SPL) is considered. In this research, a precedence-constrained multiple 0-1 knapsack problem regarding SPL characteristics is formulated to maximize the objective function depending on the value of the release, the importance of stakeholders, the urgency of a feature and its value to stakeholders. As the optimization solution approach, dynamic programming model is developed to solve the precedence-constrained multiple 0-1 knapsack problem as well as a heuristic and reduction algorithm are applied to reduce the size of the problem at each stage

Abstract
 1. Introduction
 2. Model and solution approach
  2.1 Model
  2.2 Solution approach
 3 Descriptionof the solution method
  3.1 Dynamic Programming for Multiple Releases
  3.2Dynamic Programming for Single-Release
  3.3 Greedy Algorithm
  3.4 Reduction Algorithm
 4.Numerical example
 5. Summary
 References

• Jaewook Yoo(Dong-A University)