A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM
From MaRDI portal
Publication:2790358
DOI10.1080/01969722.2012.717853zbMath1331.90070OpenAlexW2030466934MaRDI QIDQ2790358
Publication date: 4 March 2016
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969722.2012.717853
schedulinghybrid systemsvariable neighborhood searchdifferential evolutionBaldwin effectLamarckian learningweighted tardiness problem
Related Items (1)
Cites Work
- Scheduling flow shops using differential evolution algorithm
- A tabu search algorithm for the single machine total weighted tardiness problem
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Variable neighborhood search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Population set-based global optimization algorithms: some modifications and numerical studies
- A numerical study of some modified differential evolution algorithms
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Multi-objective balancing of assembly lines by population heuristics
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM
