King Fahd University of Petroleum and Minerals

Hesham Alfares

Uthman Baroudi

Abdulrahman Abu Elkhail

A method, computer software product and system for solving cyclic scheduling problems. Specifically, the present disclosure significantly improves the method in a previous patent (H. K. Alfares, 2011, 'Cyclic Combinatorial Method and System', U.S. Pat. No. 8,046,316), by eliminating a time-consuming combinatorial procedure. A procedure is described which significantly decreases the number of iterations, and hence computational time and cost. The processes of the present disclosure have many applications in cyclic workforce scheduling, cyclic transportation system scheduling, cyclic scheduling of data packet transmitting as applied to networks having a plurality of nodes and cyclic production scheduling.

Method and system for cyclic scheduling

A method, network system, and non-transitory computer readable medium that arrange a set of wireless mobile devices into a two-level clustering structure including a cluster in a first-level and a cluster in the second-level, based on node status registered and algorithm preinstalled in a back-end server, where each of the set of wireless mobile devices is assigned either one of a slave member of a cluster in the first-level, a master of a cluster in the first-level where the master is also a member of a cluster in the second-level, or a super master of a cluster in the second-level where a master of a cluster in the first-level is assigned as the super master. The two-level clustering structure is periodically updated. Only the super-masters are configured to communicate with the back-end server via a long-range connection to WLAN, while a short-range wireless interface is used for internal communications.

System and method for hierarchical clustering of wireless mobile network

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&#x2266;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.

Growing community of inventors

Dhahran, Saudi Arabia

Hesham Alfares