AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

Modified Heuristic Time Deviation Technique for Job Sequencing and Computation of Minimum Total Elapsed Time


Affiliations
1 Department of C S & E, R.V.R & J. C. College of Engineering, Guntur, A. P., India
2 Department of Computer Science and Engineering, Nagarjuna University, Guntur, Andhra Pradesh, India
 

Job sequencing is the arrangement of the task that is to be performed or processed in a machine in that particular order. Job sequencing problem has become the major problem in the computer field. A finite set of n jobs where each job consists of a chain of operations and a finite set of m machines where each machine can handle at most one operation at a time. Each operation needs to be processed during an uninterrupted period of a given length on a given machine and our Purpose is to find a schedule, that is, an allocation of the operations to time intervals to machines that has minimal length.

Keywords

Job Sequencing, Processing Time, Schedule, Non-Preemptive, Preemptive, Time Deviation, Time Duration, Total Elapsed Time, Heuristic Technique, Sequencing Rules, Earliest Due Date, Shortest Processing Time Rule.
User
Notifications
Font Size

Abstract Views: 214

PDF Views: 134




  • Modified Heuristic Time Deviation Technique for Job Sequencing and Computation of Minimum Total Elapsed Time

Abstract Views: 214  |  PDF Views: 134

Authors

N. Nagamalleswara Rao
Department of C S & E, R.V.R & J. C. College of Engineering, Guntur, A. P., India
O. Naga Raju
Department of Computer Science and Engineering, Nagarjuna University, Guntur, Andhra Pradesh, India
I. Ramesh Babu
Department of Computer Science and Engineering, Nagarjuna University, Guntur, Andhra Pradesh, India

Abstract


Job sequencing is the arrangement of the task that is to be performed or processed in a machine in that particular order. Job sequencing problem has become the major problem in the computer field. A finite set of n jobs where each job consists of a chain of operations and a finite set of m machines where each machine can handle at most one operation at a time. Each operation needs to be processed during an uninterrupted period of a given length on a given machine and our Purpose is to find a schedule, that is, an allocation of the operations to time intervals to machines that has minimal length.

Keywords


Job Sequencing, Processing Time, Schedule, Non-Preemptive, Preemptive, Time Deviation, Time Duration, Total Elapsed Time, Heuristic Technique, Sequencing Rules, Earliest Due Date, Shortest Processing Time Rule.