From 58c386175e427545f2c644b9c707f2b3125fc2d4 Mon Sep 17 00:00:00 2001
From: Maximilian Schlosser <maximilian.schlosser@tu-dresden.de>
Date: Fri, 23 Jun 2017 19:05:31 +0200
Subject: [PATCH] merge

---
 doc.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/doc.md b/doc.md
index 4eed2da..b9b2076 100644
--- a/doc.md
+++ b/doc.md
@@ -34,4 +34,3 @@ Both operations require that the start times are recomputed.
   - 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.
   - compute only one possible next solution, rate, drop/accept. $\delta$ is computed iteratively during generation
-  -