Simulate a distributed task scheduling using max-min min-max slb algorithms and compare between them.
- Machines in the rows
- Tasks in the columns
- The intersection between the row (A) and the column (Y) is the time that will take the machine (A) to complet The task (Y).
- Import a file or create your own table using the interface
- Lunch the three algrimthes togather and compare between theme
- Relunch the calcul using the precedent state (the previous result)