Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

@article{Costa2012HybridizingVA,
  title={Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime},
  author={Wagner Emanoel Costa and Marco C{\'e}sar Goldbarg and Elizabeth Ferreira Gouvea Goldbarg},
  journal={Expert Syst. Appl.},
  year={2012},
  volume={39},
  pages={13118-13126}
}
This paper presents a new hybridization of VNS and path-relinking on a particle swarm framework for the permutational fowshop scheduling problem with total flowtime criterion. The operators of the proposed particle swarm are based on path-relinking and variable neighborhood search methods. The performance of the new approach was tested on the bechmark suit of Taillard, and five novel solutions for the benchmark suit are reported. The results were compared against results obtained using methods… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Basic Scheduling Problems

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…