2006 | OriginalPaper | Chapter
Planning Disassembly for Remanufacturing Under a Rolling Schedule Environment
Authors : Tobias Schulz, Ian M. Langella
Published in: Operations Research Proceedings 2005
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 problems-pecific 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.