Capacitated disassembly scheduling with random demand
From MaRDI portal
Recommendations
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- Capacitated disassembly scheduling under stochastic yield and demand
- KI 2005: Advances in Artificial Intelligence
- A two-stage heuristic for disassembly scheduling with assembly product structure
- A branch and bound algorithm for disassembly scheduling with assembly product structure
Cites work
- A branch and bound algorithm for disassembly scheduling with assembly product structure
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- A two-stage heuristic for disassembly scheduling with assembly product structure
- Deterministic Production Planning: Algorithms and Complexity
- Disassembly line in product recovery
- Disassembly Modeling for Assembly, Maintenance, Reuse and Recycling
- Disassembly scheduling: literature review and future research directions
- Disassembly sequencing: A survey
- Dynamic lot sizing with random demand and non-stationary costs
- Heuristics for solving disassemble-to-order problems with stochastic yields
- Modelling and evaluating product end-of-life options
- On convergence rates of subgradient optimization methods
- Remanufacturing planning for the reverse Wagner/Whitin models
- Scheduling disassembly
- Validation of subgradient optimization
Cited in
(16)- Capacitated disassembly scheduling under stochastic yield and demand
- Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times
- Towards circular economy in production planning: challenges and opportunities
- Master disassembly scheduling in a remanufacturing system with stochastic routings
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
- Planning disassembly for remanufacturing under a rolling schedule environment
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- A branch and bound algorithm for disassembly scheduling with assembly product structure
- Scheduling disassembly
- A two-stage heuristic for disassembly scheduling with assembly product structure
- Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes
- The use of chance constrained programming for disassemble-to-order problems with stochastic yields
- Disassembly scheduling: literature review and future research directions
- Capacitated disassembly lot-sizing problem with disposal decisions for multiple product types with parts commonality
- Disassembly EOQ models with price-sensitive demands
- Heuristics for demand-driven disassembly planning
This page was built for publication: Capacitated disassembly scheduling with random demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168921)