From: Mart Lubbers Date: Fri, 30 Oct 2015 17:04:09 +0000 (+0100) Subject: final commit X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=c5296eb3b5ea2d8346674ad0a606d4f91fde8943;p=ar1516.git final commit --- diff --git a/1.tex b/1.tex index 0202521..90ac232 100644 --- a/1.tex +++ b/1.tex @@ -22,7 +22,6 @@ delivered, and show how for that number all pallets may be divided over the six trucks. } -\newpage \subsection{Formal definition} For every truck $t_i$ for $i\in T$ where $T=\{1,\ldots,6\}$ in combination with every nuzzle $n$, prittle $p$, skipple $s$, crottle $c$ and dupple $d$ we diff --git a/2.tex b/2.tex index 0d2b463..4aff1d0 100644 --- a/2.tex +++ b/2.tex @@ -20,7 +20,6 @@ components satisfying the following constraints: \end{itemize} } -\newpage \subsection{Formal definition} For every component $c_{i}$ for $i\in PC\cup RC$ where $PC=\{1,\ldots,3\}$ and $RC=\{4,\ldots,11\}$ we define a width, a height, an $x$ and a $y$ variables diff --git a/3.tex b/3.tex index 25de903..19e2ad6 100644 --- a/3.tex +++ b/3.tex @@ -19,7 +19,6 @@ Find a solution of this scheduling problem for which the total running time is minimal. } -\newpage \subsection{Formal definition} For every job $j_{i}$ for $i\in J$ where $J=\{1,\ldots,12\}$ we define variable $j_{i}s$ for starting time. All jobs that have a shared resource we group as diff --git a/4.tex b/4.tex index 07cd2df..91f1506 100644 --- a/4.tex +++ b/4.tex @@ -10,7 +10,6 @@ after a number of steps a number of steps a number $\geq 50$ occurs at least twice in $a_1; a_2; a_3; a_4; a_5; a_6; a_7$. } -\newpage \subsection{Formal definition} For every variable $a_i$ for $i\in I$ where $I=\{1,\ldots,7\}$ we define variables for all iterations $n$ for $n\in N$ where $N=\{1,\ldots,K\}$ for a