Question: Consider Example, illustrating the use of Johnson's algorithm for three machines. List all optimal solutions for this example.
Example: Consider the following job times for a three-machine problem. Assume that the jobs are processed in the sequence A-B-C.
![1961_9.6.png](https://secure.tutorsglobe.com/CMSImages/1961_9.6.png)