An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
DOI10.1007/978-3-030-22788-3_6zbMATH Open1442.90093OpenAlexW2971410779MaRDI QIDQ3296385FDOQ3296385
Zhi-Hai Zhang, Kanglin Liu, Meng Wang
Publication date: 7 July 2020
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-22788-3_6
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
Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Mixed integer programming (90C11) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- A cutting plane approach to capacitated lot-sizing with start-up costs
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A closed-loop location-inventory problem with spare parts consideration
- Dynamic version of the economic lot size model
- Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products
- Disassembly scheduling: literature review and future research directions
- ABC β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Linear programming models for a stochastic dynamic capacitated lot sizing problem
- Heuristics for demand-driven disassembly planning
- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- A novel probabilistic formulation for locating and sizing emergency medical service stations
- Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics
- Inventory models with minimal service level constraints
- Capacitated disassembly scheduling under stochastic yield and demand
- Capacitated disassembly scheduling with random demand
- Scheduling disassembly
- Heuristics for solving disassemble-to-order problems with stochastic yields
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A reformulation for the stochastic lot sizing problem with service-level constraints
- A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time
Uses Software
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)
