From 06573ed2a0e9b11256ab6c30a3fafd928febb4dc Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Rodolphe=20Br=C3=A9ard?= Date: Wed, 30 Oct 2024 20:45:10 +0100 Subject: [PATCH] Fix typos --- README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index b4b03cd..9088672 100644 --- a/README.md +++ b/README.md @@ -23,9 +23,8 @@ the [optimal job scheduling problem][ojs problem] and can often be seen as a ### Example -If we have 4 tasks tasks to execute. Three of then takes 1 second each to -execute and the last one takes 3 seconds. We have 2 processing units of equal -power. +We have 4 tasks tasks to execute. Three of them takes 1 second each to execute +and the last one takes 3 seconds. We have 2 processing units of equal power. 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