schmittlauch/JobShopScheduling
1
0
Fork 0
forked from PSSAI_Team/JobShopScheduling
Code Issues Pull requests Projects Releases Wiki Activity

merge

Browse source
This commit is contained in:
Maximilian Schlosser 2017-06-23 19:05:31 +02:00
parent 21f78a0479
commit 58c386175e
1 changed files with 0 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
doc.md
View file

@ -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$] - 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. - 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 - compute only one possible next solution, rate, drop/accept. $\delta$ is computed iteratively during generation
-