Timeline for Scheduling: Existence of specific total order
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2020 at 0:01 | answer | added | vonbrand | timeline score: 0 | |
| Feb 5, 2020 at 6:37 | vote | accept | Moritz | ||
| Feb 4, 2020 at 20:18 | answer | added | Tassle | timeline score: 1 | |
| Feb 4, 2020 at 19:52 | history | edited | Moritz | CC BY-SA 4.0 |
added 1313 characters in body
|
| Feb 4, 2020 at 19:34 | history | edited | Moritz | CC BY-SA 4.0 |
Added relation to scheduling problem
|
| Feb 4, 2020 at 18:07 | comment | added | D.W.♦ | Cool, can you edit to add that motivation? Don't add "EDIT" - we have revision history, so just make it read well for someone who encounters this for the first time. Thanks for your response! | |
| Feb 4, 2020 at 18:01 | comment | added | Moritz | Thanks for the welcome :) I was thinking of putting this to cstheory.stackexchange.com (maybe I'll migrate it if I figure out how). The reason why I thought this would be interesting is that it is related to scheduling: p and p' are reservations (with x1, x2 start / end of a reservation) for some resources, and if p < p' or p' < p there is no conflict (deadlock). The "preorder" comes from different resources. I just abstracted all this scheduling stuff away. | |
| Feb 4, 2020 at 18:01 | history | edited | Moritz | CC BY-SA 4.0 |
added 38 characters in body
|
| Feb 4, 2020 at 17:06 | comment | added | D.W.♦ | Welcome to CS.SE! This sounds to me like a question about math rather than about computer science. Is there a reason I'm missing why it is best answered by a computer scientist rather than a mathematician, or why it is of particular interest to computer scientists? | |
| Feb 4, 2020 at 16:50 | review | First posts | |||
| Feb 4, 2020 at 18:31 | |||||
| Feb 4, 2020 at 16:45 | history | asked | Moritz | CC BY-SA 4.0 |