[HTML][HTML] A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty

H Gu, HC Lam, Y Zinder - EURO Journal on Computational Optimization, 2022 - Elsevier
This study addresses the scheduling problem where every job requires several types of
resources. At every point in time, the capacity of resources is limited. When necessary, the …

A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs

E Ogbe, X Li - Journal of Global Optimization, 2019 - Springer
This paper proposes a joint decomposition method that combines Lagrangian
decomposition and generalized Benders decomposition, to efficiently solve multiscenario …

[HTML][HTML] Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem

G Vojvodic, LJ Novoa, AI Jarrah - EURO Journal on Computational …, 2023 - Elsevier
The main purpose of solving a classical generation capacity expansion problem is to ensure
that, in the medium-to long-term time frame, the electric utility has enough capacity available …

Application of optimization to the production planning of construction prefabrication supply chains

CTT Ho - 2019 - digital.lib.washington.edu
Prefabrication and modularization are a growing trend in the construction industry.
Efficiencies of the operation of construction prefabrication and modularization (CP&M) …

Improved benders decomposition and feasibility validation for two-stage chance-constrained programs in process optimization

Y Yang - Industrial & Engineering Chemistry Research, 2019 - ACS Publications
The two-stage stochastic program with probabilistic constraints is studied by assuming
normally distributed uncertain parameters. At stage I, the decision, represented by discrete …

[图书][B] On high-performance benders-decomposition-based exact methods with application to mixed-integer and stochastic problems

R Rahmaniani - 2018 - search.proquest.com
Stochastic integer programming (SIP) combines the difficulty of uncertainty and non-
convexity, and constitutes a class of extremely challenging problems to solve. Efficiently …

Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem

A Hosseininasab, F Gzara - Optimization Letters, 2020 - Springer
This paper studies a two-stage stochastic facility location and network flow problem with
uncertainty in demand, supply, network availability, transportation costs, and cost of facility …

Extended cross decomposition for mixed-integer linear programs with strong and weak linking constraints

E Ogbe, X Li - Computers & Chemical Engineering, 2018 - Elsevier
Large-scale mixed-integer linear programming (MILP) problems, such as those from two-
stage stochastic programming, usually have a decomposable structure that can be exploited …

Reliable Distribution Network Design with Link Disruption Using Cross Decomposition

V Kumar, R Anand - Procedia Computer Science, 2018 - Elsevier
This paper proposes a model for reliable facility location with distribution protection. The
proposed model utilizes site-dependent failure probabilities and random link disruptions. It …

Задачи дискретной оптимизации с квазиблочными матрицами

ДВ Лемтюжникова, ДВ Ковков - International Journal of Open …, 2017 - cyberleninka.ru
Рассмотрены алгоритмы для решения це-лочисленных квазиблочных задач
оптимизации. Проана-лизированы современные методы декомпозиции. Иссле-дован …