We show this build problem is NP-hard which indicates the necessity of efficient heuristic solution procedures. This paper considers several "greedy" type algorithms based on grouping parts according ...