| 摘要 |
A computing system receives user input of scheduling problem data. The scheduling problem data relates to a scheduling problem and includes one or more stations and tasks to be performed by at least one station. The computing system constructs a graph problem using the scheduling problem data. The graph problem includes a graph. The computing system cuts the graph into sub-graphs using a cut algorithm to create a cut result that satisfies a threshold and identifies one or more task exceptions from the sub-graphs in the cut result. The one or more task exceptions are tasks that can be assigned to more than one sub-graph. The computing system creates scheduling sub-problems pertaining to the one or more task exceptions using the cut result. |
