This contribution examines the performance of both exact as well as heuristic solution methods for the disassemble-to-order problem under a rolling schedule planning environment. The results indicate that the problem-specific heuristic exhibits good average performance, and low dispersion and low maximum penalty values. Even so, the cost penalties remain higher than that of applying exact methods to the rolling schedule problem.
展开▼
