A branch and bound algorithm for disassembly scheduling with assembly product structure
From MaRDI portal
Publication:3617337
DOI10.1057/palgrave.jors.2602568zbMath1156.90365OpenAlexW2089003176MaRDI QIDQ3617337
No author found.
Publication date: 23 March 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602568
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
Capacitated disassembly scheduling with random demand ⋮ Job-shop production scheduling with reverse flows ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ Integrated disassembly and reprocessing lot-sizing for multi-level structured products in remanufacturing systems ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ On the cooperation of recycling operations ⋮ Disassembly scheduling: literature review and future research directions
This page was built for publication: A branch and bound algorithm for disassembly scheduling with assembly product structure
