SINGLE MACHINE SCHEDULING | Sequencing SPT and EDD Rule

The basic single machine scheduling problem is characterized by the following conditions:
1. A set of independent, single-operation jobs is available for processing at time zero.
2. Set-up time of each job is independent of its position in jobs sequence. So, the set-up time of
each job can be included in its processing time.
3. Job descriptors are known in advance.
4. One machine is continuously available and is never kept idle when work is waiting.
5. Each job is processed till its completion without break.

SHORTEST PROCESSING TIME (SPT) RULE
In single machine scheduling problem, sequencing the jobs in increasing order of processing time is known as the shortest processing time (SPT) sequencing. Sometimes we may be interested in minimizing the time spent by jobs in the system. This, in turn, will minimize the in-process inventory

EARLIEST DUE DATE (EDD) RULE
In a single machining scheduling problem, sequencing of jobs in increasing order of due date is known as ‘Earliest Due Date Rule’.

[Mishraji_hain]

Sir, how to solve it, if we have three machines instead of two?