From e82512f2b0a6a7e9bf1df775229324262a3582fc Mon Sep 17 00:00:00 2001 From: Trolli Schmittlauch Date: Mon, 26 Jun 2017 14:16:02 +0200 Subject: [PATCH 1/2] correct possible ambiguation of and --- doc.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc.md b/doc.md index b9b2076..8d63bd9 100644 --- a/doc.md +++ b/doc.md @@ -31,6 +31,6 @@ Both operations require that the start times are recomputed. - only one job on a machine any given time ## implementation in Python - - translate jobs into lists of tasks, problem into list of jobs, ie problem = [$T_0, T_1,\dots,T_{k-1}$], $T_i$ = [$\tau_1,\tau_2,\dots$] - - address tasks based on their indices, ie [0][1] is the second job of the first task. + - translate problem into list of jobs, jobs into lists of tasks, ie problem = [$T_0, T_1,\dots,T_{k-1}$], $T_i$ = [$\tau_1,\tau_2,\dots$] + - address tasks based on their indices, ie [0][1] is the second task of the first job. - compute only one possible next solution, rate, drop/accept. $\delta$ is computed iteratively during generation From 457eaf74be3bd898c6420ada9813140fc92891b3 Mon Sep 17 00:00:00 2001 From: maxschlosser Date: Mon, 26 Jun 2017 21:43:14 +0200 Subject: [PATCH 2/2] Update 'doc.md' --- doc.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc.md b/doc.md index 8d63bd9..fd1f7b9 100644 --- a/doc.md +++ b/doc.md @@ -28,7 +28,7 @@ Both operations require that the start times are recomputed. ## constraints - only schedule new $\tau$ if another $\tau$ is finished - only schedule $\tau \in T_k$ that has no unscheduled predecessor in $T_k$ - - only one job on a machine any given time + - only one task on a machine any given time ## implementation in Python - translate problem into list of jobs, jobs into lists of tasks, ie problem = [$T_0, T_1,\dots,T_{k-1}$], $T_i$ = [$\tau_1,\tau_2,\dots$]