Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties
DOI10.1016/J.EJOR.2019.12.030zbMATH Open1441.90034OpenAlexW3000609307MaRDI QIDQ2178069FDOQ2178069
Authors: Zhengyang Hu, Guiping Hu 
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.12.030
Recommendations
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
- A robust optimization approach for the unrelated parallel machine scheduling problem
- Robust optimization for lot-sizing problems under yield uncertainty
- A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups
robust optimizationstochastic programmingsupply chain managementlot-sizing and schedulingautomotive industry
Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15) Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06)
Cites Work
- Scenario reduction algorithms in stochastic programming
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- The sample average approximation method for stochastic discrete optimization
- Introduction to Stochastic Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust linear optimization under general norms.
- Robust convex optimization
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- A robust optimization approach to closed-loop supply chain network design under uncertainty
- Stability analysis of portfolio management with conditional value-at-risk
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
- Supply chain network design under uncertainty: a comprehensive review and future research directions
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
Cited In (7)
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
- Robust optimization for lot-sizing problems under yield uncertainty
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties
- Optimization with uncertainties: a scheduling example
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Agile two-stage lot-sizing and scheduling problem with reliability, customer satisfaction and behaviour under uncertainty: a hybrid metaheuristic algorithm
This page was built for publication: Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178069)
