A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
From MaRDI portal
Publication:410367
DOI10.1155/2011/390593zbMATH Open1235.90068OpenAlexW2089380635WikidataQ58692985 ScholiaQ58692985MaRDI QIDQ410367FDOQ410367
Publication date: 3 April 2012
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/390593
Recommendations
- A hybrid evolutionary algorithm for the job shop scheduling problem
- Multi-objective flow shop scheduling using differential evolution
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization
Cites Work
- Advances in differential evolution
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- On a routing problem
- Title not available (Why is that?)
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Scheduling flow shops using differential evolution algorithm
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Enhancing the performance of differential evolution using orthogonal design method
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- A filter-and-fan approach to the job shop scheduling problem
- Ant colony optimisation with parameterised search space for the job shop scheduling problem
- Minimizing total weighted tardiness in a generalized job shop
- A new hybrid multi-objective Pareto archive PSO algorithm for a classic job shop scheduling problem with ready times
- An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
Cited In (8)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- A hybrid evolutionary algorithm for the job shop scheduling problem
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
- Multiple active contours guided by differential evolution for medical image segmentation
- A hybrid metaheuristic for the single-machine total weighted tardiness problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A differential evolution approach for the common due date early/tardy job scheduling problem
Uses Software
This page was built for publication: A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410367)
