A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
From MaRDI portal
Publication:6114962
DOI10.1016/j.ejco.2022.100050zbMath1528.90113OpenAlexW4307571191MaRDI QIDQ6114962
Hue Chi Lam, Han-Yu Gu, Yakov Zinder
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejco.2022.100050
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for the robust resource leveling problem
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Tactical berth allocation under uncertainty
- A sample average approximation method for disassembly line balancing problem under uncertainty
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A survey on metaheuristics for stochastic combinatorial optimization
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Sublinear upper bounds for stochastic programs with recourse
- A branch and bound method for stochastic global optimization
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Sample-path optimization of convex stochastic performance functions
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
- The sample average approximation method applied to stochastic routing problems: a computational study
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- An exact solution method for the TSP with drone based on decomposition
- Planning rolling stock maintenance: optimization of train arrival dates at a maintenance center
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- Distribution network deployment for omnichannel retailing
- A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm
- A genetic algorithm for the flexible job-shop scheduling problem
- Assessing solution quality in stochastic programs
- Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints
- An evolutionary approach for resource constrained project scheduling with uncertain changes
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Improving the Integer L-Shaped Method
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- A Sequential Sampling Procedure for Stochastic Programming
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Handbook of Heuristics
- Introduction to Stochastic Programming
- Analysis of Sample-Path Optimization
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
- The generalized Poisson-binomial distribution and the computation of its distribution function
- Handbook of Statistical Distributions with Applications
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
