Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems
From MaRDI portal
Publication:3553687
zbMATH Open1184.90173MaRDI QIDQ3553687FDOQ3553687
Authors: V. P. Eswaramurthy, A. Tamilarasi 
Publication date: 21 April 2010
Full work available at URL: http://ijims.ms.tku.edu.tw/mss/M20/M20N2/o20n21/index.html
Recommendations
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Multiple colony ant algorithm for job-shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- A hybrid evolutionary algorithm for the job shop scheduling problem
Cited In (10)
- Title not available (Why is that?)
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- A heuristic hybrid framework for vector job scheduling
- A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Knowledge-based ant colony optimization for the flexible job shop scheduling problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
- Fuzzy job-shop scheduling problems: a review
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
This page was built for publication: Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553687)
