A robust optimization solution to bottleneck generalized assignment problem under uncertainty

DOI10.1007/S10479-014-1631-5MaRDI QIDQ889555zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 9 November 2015

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-014-1631-5

zbMATH Keywords

robust optimizationstochastic programmingassignmentbottleneck

Mathematics Subject Classification ID

Stochastic programming (90C15) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Recommendations

• Addressing capacity uncertainty in resource-constrained assignment problems
• Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
• An algorithm for the bottleneck generalized assignment problem
• Optimization under decision-dependent uncertainty
• Robustness of solutions to the capacitated facility location problem with uncertain demand

Cites work

• A stochastic approach to hotel revenue optimization
• Dynamic capacity acquisition and assignment under uncertainty
• Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
• Optimal production policies for multi-stage systems with setup costs and uncertain capacities
• Robust Optimization of Large-Scale Systems
• The bottleneck generalized assignment problem

Cited in

(3)

• A robust train timetable optimization approach for reducing the number of waiting passengers in metro systems
• Sensitivity analysis for bottleneck assignment problems
• Multi-criteria decision making based on relative measures

This page was built for publication: A robust optimization solution to bottleneck generalized assignment problem under uncertainty

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