A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained. It differs from local search heuristics which start with a complete solution and then try to improve the current solution further via local moves. Examples of some constructive heuristics developed for famous problems are: flow shop scheduling, vehicle routing problem, open shop problem.
References
Constructive heuristic Wikipedia(Text) CC BY-SA