An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
From MaRDI portal
(Redirected from Publication:3296385)
Recommendations
- Capacitated disassembly scheduling with random demand
- Capacitated disassembly scheduling under stochastic yield and demand
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- An optimization model and an algorithm for solving lot-sizing disassembly with multi-resource constraints
- KI 2005: Advances in Artificial Intelligence
- A branch and bound algorithm for disassembly scheduling with assembly product structure
- Master disassembly scheduling in a remanufacturing system with stochastic routings
- A disassemble-to-order heuristic for use with constrained disassembly capacities
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- A closed-loop location-inventory problem with spare parts consideration
- A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time
- A cutting plane approach to capacitated lot-sizing with start-up costs
- A novel probabilistic formulation for locating and sizing emergency medical service stations
- A reformulation for the stochastic lot sizing problem with service-level constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Capacitated disassembly scheduling under stochastic yield and demand
- Capacitated disassembly scheduling with random demand
- Disassembly scheduling: literature review and future research directions
- Dynamic version of the economic lot size model
- Heuristics for demand-driven disassembly planning
- Heuristics for solving disassemble-to-order problems with stochastic yields
- Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products
- Inventory models with minimal service level constraints
- Linear programming models for a stochastic dynamic capacitated lot sizing problem
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- Scheduling disassembly
- Solving mixed integer nonlinear programs by outer approximation
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- \(ABC_{\beta }\)-a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
Cited in
(2)
This page was built for publication: An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296385)
