AIRCC's International Journal of Computer Science and Information Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


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