A discrete particle swarm optimization algorithm for scheduling parallel machines

[1]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[2]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[3]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[4]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[5]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[6]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[7]  Michael N. Vrahatis,et al.  Particle swarm optimization for integer programming , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Jatinder N. D. Gupta,et al.  A LISTFIT heuristic for minimizing makespan on identical parallel machines , 2001 .

[9]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[10]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[11]  Chung-Yee Lee,et al.  Multiprocessor scheduling: combining LPT and MULTIFIT , 1988, Discret. Appl. Math..

[12]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[13]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[14]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[15]  S.M.T. Fatemi Ghomi,et al.  A pairwise interchange algorithm for parallel machine scheduling , 1998 .

[16]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.