Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty

DOI10.1016/J.ORL.2011.06.013zbMATH Open1235.90104OpenAlexW1965056266MaRDI QIDQ408396FDOQ408396

Authors: Mu-Hong Zhang 

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.013

Recommendations

• Robust inventory problem with budgeted cumulative demand uncertainty
• Production planning under demand uncertainty: a budgeted uncertainty approach
• The robust multi-plant capacitated lot-sizing problem
• Min-max regret robust optimization approach on interval data uncertainty
• A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches

zbMATH Keywords

lot-sizingrobust optimizationmixed integer programmingminimax regret

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Price of Robustness
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Interval data minmax regret network optimization problems
• Title not available (Why is that?)
• On the complexity of a class of combinatorial optimization problems with uncertainty
• Dynamic version of the economic lot size model
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Adjustable robust solutions of uncertain linear programs
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Minmax regret solutions for minimax optimization problems with uncertainty
• The minmax regret permutation flow-shop problem with two jobs
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems

Cited In (17)

• Robust inventory control under demand and lead time uncertainty
• Robust optimization for lot-sizing problems under yield uncertainty
• Single-item dynamic lot-sizing problems: an updated survey
• Lot sizing with storage losses under demand uncertainty
• On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
• The robust multi-plant capacitated lot-sizing problem
• Recent advances in robust optimization: an overview
• Home health care facility location problem under demand uncertainty
• Two-stage stochastic lot-sizing problem under cost uncertainty
• Comparison of different approaches to multistage lot sizing with uncertain demand
• Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
• Two-stage robust mixed integer programming problem with objective uncertainty
• Min-max regret robust optimization approach on interval data uncertainty
• A robust model for the lot-sizing problem with uncertain demands
• Robust postdonation blood screening under prevalence rate uncertainty
• Robust inventory problem with budgeted cumulative demand uncertainty
• An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives

This page was built for publication: Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408396)