Min-min, min-max, max-min, max-max menu driven scheduling algorithm using c++
Menu driven source code to select between four different scheduling i.e min-min,min-max,max-min and max-max algorithms to know which task will be allocated to which machine in much efficient way.
Menu driven source code to select between four different scheduling i.e min-min,min-max,max-min and max-max algorithms to know which task will be allocated to which machine in much efficient way.
Case 1 : MIN-MIN
Here the task with minimum completion time is selected and then the one with minimum execution time is allocated to the resource.
Case 2 : MIN-MAX
Here the task with minimum completion time is selected and then the one with maximum execution time is allocated to the resource.
Case 1 : MAX-MIN
Here the task with maximum completion time is selected and then the one with minimum execution time is allocated to the resource.
Case 1 : MAX-MAX
Here the task with maximum completion time is selected and then the one with maximum execution time is allocated to the resource.
Project Files
| .. | ||
| This directory is empty. | ||