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

Update 'doc.md'

Browse source
This commit is contained in:
maxschlosser 2017-06-26 21:43:14 +02:00
parent e82512f2b0
commit 457eaf74be
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
doc.md
View file

@ -28,7 +28,7 @@ Both operations require that the start times are recomputed.
## constraints ## constraints
- only schedule new $\tau$ if another $\tau$ is finished - only schedule new $\tau$ if another $\tau$ is finished
- only schedule $\tau \in T_k$ that has no unscheduled predecessor in $T_k$ - 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 ## 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$] - 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$]