|
  
.gif)
| |
Longest Processing Time (SPT) :
The longest job are handled first and completed.
The step for using this rule are:
 | Firstly, the user will input the number of jobs, the job names,the
processing time and the due date of each job or use the data values given at the starting
point. |
| The second step is sorting out the longest processing time among the jobs. |
| Thirdly, calculate the flow time of each job by using the processing time.
the flow time is the accummulations of processing time each job by each job. |
| The
next step is calculating the total processing time, total flow time and
total delays from the accummulations processing time, the accummulations flow time and the
accummulations delays. |
| Then, using the total flow time, total processing time, and total
delays for calculating the average completion time, the utilisation, the average number of
jobs in the system and the average job delays. |
| These above are the steps for using the LPT priority rules. |
Demo Using LPT in Example(Power Point
Presentation)
Back to Solution by
Using LPT
 Example with LPT method
 Back to Top
[Priority Rules] [Types
of Priority Rules] [FCFS]
[EDD] [SPT]
[LPT] [CR]
|
