An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand

DOI10.1007/978-3-030-22788-3_6zbMath1442.90093OpenAlexW2971410779MaRDI QIDQ3296385

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Uses Software

• YALMIP
• Bonmin
• OPTI

Cites Work

• Unnamed Item
• A closed-loop location-inventory problem with spare parts consideration
• Linear programming models for a stochastic dynamic capacitated lot sizing problem
• An efficient computational method for a stochastic dynamic lot-sizing problem under 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
• Heuristics for demand-driven disassembly planning
• Heuristics for solving disassemble-to-order problems with stochastic yields
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• An algorithmic framework for convex mixed integer nonlinear programs
• An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
• Solving mixed integer nonlinear programs by outer approximation
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A reformulation for the stochastic lot sizing problem with service-level constraints
• Capacitated disassembly scheduling under stochastic yield and demand
• A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time
• Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products
• Dynamic Version of the Economic Lot Size Model
• ABC _β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
• Capacitated disassembly scheduling with random demand
• A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
• Uncapacitated Lot-Sizing Problems with Start-Up Costs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
• Scheduling disassembly
• Disassembly scheduling: literature review and future research directions
• Inventory models with minimal service level constraints
• Benchmarking optimization software with performance profiles.

This page was built for publication: An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand