Capacitated disassembly scheduling under stochastic yield and demand
From MaRDI portal
Publication:1744511
DOI10.1016/j.ejor.2017.08.032zbMath1431.90074OpenAlexW2750302929MaRDI QIDQ1744511
Publication date: 23 April 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.032
Mixed integer programming (90C11) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Stochastic scheduling theory in operations research (90B36)
Related Items (7)
Disassembly EOQ models with price-sensitive demands ⋮ Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ Optimum operational schedule and accounts receivable financing in a production supply chain considering hierarchical industrial status and uncertain yield ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Joint energy capacity and production planning optimization in flow-shop systems ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
Uses Software
Cites Work
- Unnamed Item
- A disassembly line balancing problem with fixed number of workstations
- Sustainable operations
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- A sample average approximation method for disassembly line balancing problem under uncertainty
- 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
- 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
- A path-relinking approach for a bi-criteria disassembly sequencing problem
- 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
- Multiple lotsizing in production to order with random yields: review of recent advances
- 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
- Distributionally robust joint chance constraints with second-order moment information
- A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system
- Constraint programming for computing non-stationary \((R, S)\) inventory policies
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- ABC β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
- Capacitated disassembly scheduling with random demand
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- Methods for optimum and near optimum disassembly sequencing
- A branch and bound algorithm for disassembly scheduling with assembly product structure
- 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
- Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes
- Lot Sizing with Random Yields: A Review
- OR FORUM—The Evolution of Closed-Loop Supply Chain Research
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
This page was built for publication: Capacitated disassembly scheduling under stochastic yield and demand
