| 摘要 |
The cyclic combinatorial method and system includes an optimizing programming method embodied in a computing machine in order to provide the capability to solve cyclic optimization problems. The method can be used to solve optimization problems having cyclic 0-1 matrices, such as network problems and cyclic workforce scheduling. The method identifies cyclically distinct solutions by enumerating cyclically distinct combinations of basic dual variables. The method can determine how many cyclically distinct combinations of m (m<=n) objects can be selected, given n cyclic objects. The method integrates partition and cyclic permutation operations in order to generate cyclically distinct selections (solutions). After cyclically enumerating all dual solutions, rules are described for recognizing the set of dominant solutions. A class of problems, which includes cyclic labor scheduling, can be efficiently solved using the cyclic combinatorial method and system.
|
