A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems

Using Simulated Annealing for Open Shop Scheduling with Sum Criteria

“…For the simulated annealing routine, a very small initial temperature of 2 was used. Computational results have been presented for some benchmark instances with up to 20 jobs and machines given by Taillard (1993) (however, the values stated as best known solutions in Yang et al (2006) are rather far away from the real best known solutions so that also the results presented in that paper are not competitive). For a discussion of further exact and heuristic algorithms for open shop problems with minimizing the makespan, the reader is referred to Andresen et al (2008).…”

“…In particular, comparing the best results of some beam-insert variant from Bräsel et al (1993) with the best of the five runs of the simulated annealing algorithm from Liaw (1999) on the 30 benchmark instances with n = m ∈ {10, 20, 30} given by Taillard (1993), the results were equal for 18 instances, 8 times the simulated annealing algorithm was better and four times the beam-insert algorithm was better. A particle swarm algorithm combined with simulated annealing has been given by Yang et al (2006). For the simulated annealing routine, a very small initial temperature of 2 was used.…”