rodolphe/rust_job_scheduling
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Fix typos

Browse source
This commit is contained in:
Rodolphe Bréard 2024-10-30 20:45:10 +01:00
parent fa3dbd719d
commit 06573ed2a0
1 changed files with 2 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
README.md
View file

@ -23,9 +23,8 @@ the [optimal job scheduling problem][ojs problem] and can often be seen as a
### Example ### Example
If we have 4 tasks tasks to execute. Three of then takes 1 second each to We have 4 tasks tasks to execute. Three of them takes 1 second each to execute
execute and the last one takes 3 seconds. We have 2 processing units of equal and the last one takes 3 seconds. We have 2 processing units of equal power.
power.
If each processing unit starts by executing one of the 1s tasks, they will both If each processing unit starts by executing one of the 1s tasks, they will both
finis this job after one second. Then, one of those processing unit will finis this job after one second. Then, one of those processing unit will