PSSAI_Team/JobShopScheduling
2
0
Fork 1
Code Issues 2 Pull requests Releases Wiki Activity

Merge branch 'task_job_verwechslung' of PSSAI_Team/JobShopScheduling into master

Browse source
This commit is contained in:
maxschlosser 2017-06-26 21:43:58 +02:00 committed by Gitea
parent 3b8fd60ede 457eaf74be
commit 0874188b06
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
doc.md
View file

@ -28,9 +28,9 @@ 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 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