The first major research on the DPLP was undertaken by Rosenblatt [3]. He uses dynamic programming (DP)to solve the DPLP. Each period in the planning horizon forms a stage. It can be shown that (N!)t options would have to be explicitly or implicitly evaluated in order to find the optimal solution, where N is the number of departments in the layout and t is the number of periods
in the planning horizon.