Advanced Modified Time Deviation Method for Job Sequencing
Keywords:
Advanced Modified Time Deviation Method, Total Elapsed Time, Optimal Solution, Johnson's AlgorithmAbstract
Job sequencing is the arrangement of the task that is to be precede in a machine in that particular order. In this paper, we proposed "Advanced modified time deviation method" for solving the optimal sequence for n-jobs. This method is first used for 2-machine n-jobs problem and extended for 3-machine n-jobs problem and also extended for m-machine n-job problem, by using Johnson's algorithm to find total elapsed time.
References
- Joss Sanchez-Perez, "A Payoff System for Job Scheduling Problems",Journal of Applied Mathematics Sciences, Vol. 5, No. 19, pp.911 – 920, 2011.
- Surekha P, S.Sumathi, "Solving Fuzzy based Job Shop Scheduling Problems using Ga and Aco", Journal of Emerging Trends in Computing and Information Sciences, Vol. 1, No. 2, Oct 2010.
- Pervaiz Iqbal, Dr. P. S. Sheik Uduman and Dr. S. Srinivasan," Job Sequencing Problem Using Advanced Heuristics Techniques, Proceeding of the International Conference on Applied Mathematics and Theoretical Computer Science, 978-93-82338-35-2.(ISBN) 2013.
- N. Nagamalleswara Rao1Dr. O. Naga Raju2 and Prof. I. Ramesh Babu3, "Modified Heuristics Time Deviation Techniques for Job Sequencing and Computing of Minimum Total Elapsed Time, International Journal of Computer Science & Informing Technology (IJCSIT), Vol.5, No. 3, June 2013.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.