References

Beausoleil, R.P., 2011. A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem. J. Math. Theory Appl., 9: 35-46.
Direct Link  |  

Chen, J.S., J.C.H. Pan and C.K. Wu, 2008. Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Syst. Appl., 34: 1924-1930.
Direct Link  |  

Etminani, K. and M. Naghibzadeh, 2007. A min-min max-min selective algorihtm for grid task scheduling. Proceedings of the 3rd IEEE/IFIP International Conference in Central Asia on Internet, ICI 2007, September 26-28, 2007, IEEE, Tashkent, Uzbekistan, ISBN: 978-1-4244-1007-1, pp: 1-7.

Foster, I. and C. Kesselman, 2003. The grid2: Blueprint for a New Computing Infrastructure (The Elsevier Series in Grid Computing). 2nd Edn., Morgan Kaufmann, San Francisco, CA, USA..

Foster, I., C. Kesselman and S. Tuecke, 2001. The anatomy of the grid: Enabling scalable virtual organizations. Int. J. High Perform. Comput. Applic., 15: 200-222.
CrossRef  |  Direct Link  |  

Fujimoto, N. and K. Hagihara, 2004. A comparison among grid scheduling algorithms for independent coarse-grained tasks. Proceedings of the 2004 International Symposium on Applications and the Internet Workshops, SAINT 2004 Workshops, January 26-30, 2004, IEEE, USA., ISBN: 0-7695-2050-2, pp: 674-680.

Goswami, R., T.K. Ghosh and S. Barman, 2011. Local search based approach in grid scheduling using simulated annealing. Proceedings of the 2011 2nd International Conference on Computer and Communication Technology (ICCCT), September 15-17, 2011, IEEE, Allahabad, India, ISBN: 978-1-4577-1385-9, pp: 340-345.

Graham, R.L., E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, 1979. Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Ann. Discrete Math., 5: 287-326.
CrossRef  |  

Maheswaran, M., S. Ali, H.J. Siegel, D. Hensgen and R.F. Freund, 1999. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. Proceedings of the 8th Heterogeneous Computing Workshop, April 12, 1999, San Juan, Puerto Rico, pp: 30-44.

Matsumura, Y., K. Ohkura, Y. Matsuura, M. Oiso and N. Fujimoto et al., 2007. Grid task scheduling algorithm R3Q for evolution strategies. Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, September 25-28, 2007, IEEE, Singapore, ISBN: 978-1-4244-1339-3, pp: 1756-1763.

Pfund, M., J.W. Fowler, A. Gadkari and Y. Chen, 2008. Scheduling jobs on parallel machines with setup times and ready times. Comput. Ind., 54: 764-782.
CrossRef  |  Direct Link  |  

Pinedo, M., 2008. Scheduling: Theory, Algorithms and Systems. 3rd Edn., Springer, New York, ISBN 0387789340.

Shah, S.N.M., A.K.B. Mahmood and A. Oxley, 2011. Dynamic multilevel hybrid scheduling algorithms for grid computing. Proc. Comput. Sci., 4: 402-411.
CrossRef  |  Direct Link  |  

Tseng, L.Y., Y.H. Chin and S.C. Wang, 2009. The anatomy study of high performance task scheduling algorithm for grid computing system. Comput. Stand. Interfaces, 31: 713-722.
CrossRef  |  Direct Link  |  

Vepsalainen, A.P.J. and T.E. Morton, 1987. Priority rules for job shops with weighted tardiness costs. Manage. Sci., 33: 1035-1047.
Direct Link  |