Optimal scheduling for retrieval jobs in double-deep AS/RS by evolutionary algorithms
From MaRDI portal
Publication:2318920
DOI10.1155/2013/634812zbMath1432.90069OpenAlexW1976296098WikidataQ58916472 ScholiaQ58916472MaRDI QIDQ2318920
Sendren Sheng-Dong Xu, Tzong-Chen Wu, Kuo-Yang Wu
Publication date: 16 August 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/634812
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
- Using immune-based genetic algorithms for single trader's periodic marketing problem
- Nonsmooth generalized complementarity as unconstrained optimization
- Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization
- Solving singular two-point boundary value problems using continuous genetic algorithm
- On set-valued complementarity problems
- Solution properties and error bounds for semi-infinite complementarity problems
This page was built for publication: Optimal scheduling for retrieval jobs in double-deep AS/RS by evolutionary algorithms