A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
From MaRDI portal
Publication:3433485
DOI10.1057/palgrave.jors.2602094zbMath1123.90014OpenAlexW1982878811MaRDI QIDQ3433485
No author found.
Publication date: 30 April 2007
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.2602094
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (6)
Capacitated disassembly scheduling with random demand ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ Disassembly scheduling: literature review and future research directions
This page was built for publication: A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
