Timeline for What is a good algorithm for priority allocation of work duties?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2013 at 14:57 | answer | added | anthonyvd | timeline score: 2 | |
| Feb 7, 2013 at 6:56 | answer | added | Frank | timeline score: 7 | |
| Feb 7, 2013 at 3:54 | comment | added | Wee | All the work are independent of each other. It's more like assigning duties to the people and the list of people are sorted based on their rank and number of duties that he has done in the past. | |
| Feb 7, 2013 at 3:36 | history | edited | user40980 | CC BY-SA 3.0 |
Changing question from "tell me things." to "Will this work?"
|
| Feb 7, 2013 at 3:31 | comment | added | user40980 | Are there requirements of W1 be finished before W2 can be started? Or is this a "everything can be done in parallel?" Do note that this is a well studied problem domain and there are many algorithms for it depending on the exact nature of the way work can be scheduled. See Job shop scheduling and the open shop scheduling problem. | |
| Feb 7, 2013 at 2:18 | review | First posts | |||
| Feb 7, 2013 at 4:52 | |||||
| Feb 7, 2013 at 1:59 | history | asked | Wee | CC BY-SA 3.0 |