A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
From MaRDI portal
Publication:6079857
DOI10.1111/itor.12878OpenAlexW3092560364MaRDI QIDQ6079857
Seyed Mahdi Homayouni, José Fernando Gonçalves, Dalila B. M. M. Fontes
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12878
Related Items (1)
Recursive linear models optimized by bioinspired metaheuristics to streamflow time series prediction
Cites Work
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- Joint production and transportation scheduling in flexible manufacturing systems
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- A genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A research survey: review of flexible job shop scheduling techniques
- Julia: A Fresh Approach to Numerical Computing
- Heuristic solutions for general concave minimum cost network flow problems
- The Complexity of Flowshop and Jobshop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
- A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method
This page was built for publication: A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
