Timeline for Probability distribution of total time for a job, given a workflow graph
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 17 at 16:38 | comment | added | Michael Hardy | @SamHopkins : Thank you. I hope to digest that item before the weekend is over. | |
| May 16 at 21:57 | comment | added | Sam Hopkins | Typo: should be $Y_i = \max \{ Y_j \colon j\lessdot i\}+X_i$. | |
| May 16 at 21:38 | comment | added | Sam Hopkins | Let $X_i$ be the time it takes worker $i$ to complete their task, and let $Y_i$ be the time at which worker $i$ completes their task. Then $Y_i = \max \{X_j\colon j \lessdot i\} + X_i$. This operation (going from the $X_i$ to the $Y_i$) has the flavor of "piecewise-linear toggling" on posets as in arxiv.org/abs/1404.3455. | |
| May 16 at 20:58 | history | asked | Michael Hardy | CC BY-SA 4.0 |