Planning Disassembly for Remanufacturing Under a Rolling Schedule Environment

Tobias Schulz () and Ian M. Langella ()
Additional contact information
Tobias Schulz: Otto-von-Guericke University Magdeburg
Ian M. Langella: Otto-von-Guericke University Magdeburg

A chapter in Operations Research Proceedings 2005, 2006, pp 161-166 from Springer

Abstract: Abstract 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.

Keywords: Planning Horizon; Mixed Integer Linear Programming; Reverse Logistics; Procurement Cost; Core Type (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_26

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_26

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().