International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

International Journal of Computer Networks and Applications (IJCNA)

International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

An Empirical Model of Job Shop Scheduling With Related To Tiny Chemical Assembly Instructions Inside of Living Things and Gels Techniques

Author NameAuthor Details

Ganesh Potta, Santosh Naidu P

Ganesh Potta[1]

Santosh Naidu P[2]

[1]Computer Science and Engineering, MVGR College of Engineering, Andhra Pradesh, India.

[2]Computer Science and Engineering, MVGR College of Engineering, Andhra Pradesh, India.

Abstract

Usage of (math-based/computer-based) useful things/valuable supplies is always an interesting research issue in the field of Grid figuring out/calculating. Job shop scheduling is a combinatorial optimization problem it finds possible number of solution for best solution. In this paper we are proposing a blended approach of (related to tiny chemical assembly instructions inside of living things) set of computer instructions and GELS set of computer instructions for identifying missed job or best solution from set of samples or (genetic information storage areas) which contains jobs, operation and time span.

Index Terms

Gels

Job-Shop

Assembly Instructions

Reference

  1. 1.
    GENETIC ALGORITHMS FOR SHOP SCHEDULING PROBLEMS: A SURVEY( http://mat.uab.cat/~alseda/MasterOpt/p11-31.pdf)
  2. 2.
    Abdelmaguid, R. Representations in genetic algorithm for the job shop schedulingproblem: A computational study. J Software Engineering & Applications, 2010, 3,1155 - 1162.
  3. 3.
    Holland, J.A. Adaptation in natural and artificial systems. Ann Arbor: University ofMichigan, 1975.
  4. 4.
    H. El-Rewini, T. G. Lewis, H. H. Ali, Task Scheduling in Parallel andDistributed Systems, Prentice-Hall, 1994, ISBN:0-13-099235-6.
  5. 5.
    L. Khanli, M. Etminan Far , A. Ghaffari, "Reliable Job Scheduler usingRFOH in Grid Computing," Journal of Emerging Trends in Computingand Information Sciences, Vol. 1, No. 1, pp. 43- 47, 2010.
  6. 6.
    G. Gharoonifard, F. Moeindarbari, H. Deldari, A. Morvaridi, "Scheduling of scientific workflows using a chaos- genetic algorithm,"Procedia Computer Science, Elsevier, Vol. 1, No.1, pp. 1445- 1454,2010.
  7. 7.
    Q. Tao, H. Chang, Y. Yi, CH. Gu, "A Grid Workflow Scheduling Optimization approach for e-Business Application," Proceedings of Abdulal. W, Jadaan. O. A, Jabas. A, Ramachandram. S, "An ImprovedRank-based Genetic Algorithm with Limited Iterations for GridScheduling", IEEE Symposium on Industrial Electronics andApplications, pp. 215-220, October 2009. DOI:http://10.1109/ISIEA.2009.5356468
  8. 8.
    Tamilarasi. A, Ananthakumar. T, "An enhanced genetic algorithm withsimulated annealing for job-shop scheduling", International Journal ofEngineering, Science and Technology, Vol. 2, No. 1, pp. 144- 151,2010.
  9. 9.
    http://www.doaj.org/doaj?func=openurl&genre=article&issn=21412820date=2010&volume=2&issue=1&spage=14
  10. 10.
    Omaraa. F. A, Arafa. M. M,” Genetic algorithms for task schedulingproblem”, Journal Parallel Distributed Computing, Vol. 70, Iss. 1, pp.13-22, 2010.DOI: http://dx.doi.org/10.1016/j.jpdc.2009.09.009
IJCNA NPC