Consider the problem Fm || Cmax. Assume that the schedule does allow one job to pass another while they are waiting for processing on a machine. Show that there always exists an optimal schedule that does not require sequence changes between machines 1 and 2 and between machines m − 1 and m.
Please provide a theoretical proof rather than a numerical example.
Get Answers For Free
Most questions answered within 1 hours.