References

Adam, T.L., K.M. Chandy and J.R. Dickson, 1974. A comparison of list schedules for parallel processing systems. Commun. ACM, 17: 685-690.
CrossRef  |  Direct Link  |  

Ahmad, I. and Y.K. Kwok, 1999. On parallelizing the multiprocessor scheduling problem. Parallel Distrib. Syst. IEEE. Trans., 10: 414-431.
CrossRef  |  Direct Link  |  

Alba, E. and J.M. Troya, 2001. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Comput. Syst., 17: 451-465.
CrossRef  |  Direct Link  |  

Allahverdi, A., C.T. Ng, T.C.E. Cheng and Y.M. Kovalyov, 2008. A survey of scheduling problems with setup times or costs. Eur. J. Operat. Res., 187: 985-1032.
CrossRef  |  

Casavant, T.L. and J.G. Kuhl, 1988. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. Software Eng., 14: 141-154.
CrossRef  |  

Deeba, K. and K. Thanushkodi, 2009. An evolutionary approach for job scheduling in a multiprocessor architecture. Artif. Intell. Syst. Mach. Learn., 1: 122-126.
Direct Link  |  

Eberhart, R.C. and J. Kennedy, 1995. A new optimizer using particle swarm theory. Proceedings of the 6th International Symposium on Micro Machine and Human Science, October 4-6, 1995, Nagoya, Japan, pp: 39-43.

Eberhart, R.C. and Y. Shi, 1998. Comparison Between Genetic Algorithms and Particle Swarm Optimization. In: Evolutionary Programming VII. Porto, V.W., N. Saravanan, D. Waagen and A.E. Eiben (Eds.). Springer Berlin Heidelberg, Berlin, Germany, ISBN: 978-3-540-64891-8, pp: 611-616.

Garey, M.R. and D.S. Johnson, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA., USA., Pages: 338.

Higginson, J.S., R.R. Neptune and F.C. Anderson, 2005. Simulated parallel annealing within a neighborhood for optimization of biomechanical systems. J. Biomech., 38: 1938-1942.
CrossRef  |  PubMed  |  Direct Link  |  

Lee, C.Y., J.J. Hwang Y.C. Chow and F.D. Anger, 1988. Multiprocessor scheduling with interprocessor communication delays. Oper. Res. Lett., 7: 141-147.
CrossRef  |  

Lee, S.Y. and K.G. Lee, 1996. Synchronous and asynchronous parallel simulated annealing with multiple Markov chains. Parallel Distrib. Syst. IEEE. Trans., 7: 993-1008.
CrossRef  |  Direct Link  |  

Mitten, L.G., 1970. Branch-and-bound methods: General formulation and properties. Oper. Res., 18: 24-34.
Direct Link  |  

Salman, A., I. Ahmad and S. Al-Madani, 2002. Particle swarm optimization for task assignment problem. Microproc. Microsyst., 26: 363-371.
CrossRef  |  

Schutte, J., J. Reinbolt, B. Fregly and R. Haftka1, 2004. Parallel global optimization with the particle swarm algorithm. Int. J. Numerical Methods Eng., 127: 465-474.
Direct Link  |  

Selvakumar, S. and C. Murthy, 1994. Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors. Parallel Distrib. Syst. IEEE. Trans., 5: 328-336.
CrossRef  |  Direct Link  |  

Wu, M.Y. and D.D. Gajski, 1990. Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst., 1: 330-343.
CrossRef  |