Data processing: artificial intelligence – Knowledge processing system
Reexamination Certificate
2007-07-20
2011-10-25
Gaffin, Jeffrey A (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Reexamination Certificate
active
08046316
ABSTRACT:
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.
REFERENCES:
patent: 5764858 (1998-06-01), Sheu et al.
patent: 6031984 (2000-02-01), Walser
patent: 6182014 (2001-01-01), Kenyon et al.
patent: 6418398 (2002-07-01), Dueck et al.
patent: 6785736 (2004-08-01), Barillaud
patent: 6961685 (2005-11-01), Sy
patent: 7043446 (2006-05-01), Dietrich et al.
patent: 7054757 (2006-05-01), Agrafiotis et al.
patent: 7065510 (2006-06-01), Shackleford
patent: 2002/0004792 (2002-01-01), Busa
patent: 2002/0008657 (2002-01-01), Poore, Jr.
patent: 2002/0111780 (2002-08-01), Sy
patent: 2002/0174021 (2002-11-01), Chu et al.
patent: 2003/0093391 (2003-05-01), Shackleford
patent: 2004/0051057 (2004-03-01), Yoshida
patent: 2005/0097559 (2005-05-01), He
patent: 2006/0026175 (2006-02-01), Aggarwal
K. Cattell et al., Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2), Journal of Algorithms, 37, pp. 267-282 (2000).
H. Alfares and S. Selim, “A Cyclic Selection Algorithm with Scheduling Applications”, The 6th Saudi Engineering Conference, KFUPM, Dhahran, Dec. 2002, pp. 513-520.
http://www.q2s.ntnu.no/publications/open/2004/Paper—rev/2004—wittner—DAA.pdf#search=′distributed%20asynchronous%20heegaard′ “Distributed Asynchronous Algorithm for Cross-Entropy-Based Combinatorial Optimization” by P. Heegaard, et al. retrieved on Oct. 25, 2006.
Alfares, H.K. (1998), An efficient two-phase algorithm for cyclic days-off scheduling,Computers&Operations Research, 25, 11,913-923.
Alfares, H.K. (2000a), Dual-based optimization of cyclic three-day workweek scheduling,Asia-Pacific Journal of Operational Research, 17,2, 137-148.
Alfares, H.K. (2000b), Dual-based optimization of cyclic four-day workweek scheduling,IMA Journal of Mathematics Applied in Business&Industry, 11, 4, 269283.
https://dspace.mit.edu/handle/1721.1/8526 “Cyclic Exchange and Related Neighborhood Structures for Combinatorial Optimization Problems” by D. Sharma retrieved on Oct. 25, 2006.
http://www.optimization-online.org/DB—FILE/2002/04/465.pdf “Solving Stability Problems on a Superclass of Interval Graphs” by C. Mannino, et al. retrieved on Oct. 25, 2006.
Alfares, H.K. (2001), Efficient optimization of cyclic labor days-off scheduling,OR Spektrum, 23, 2, 283-294.
Alfares, H.K. (2003a), Flexible four-day workweek scheduling with weekend work frequency constraints,Computers&Industrial Engineering, 44, 3, 325-338.
Alfares, H.K. (2003b), Compressed workweek scheduling with differing weekdays and weekends labor demands,Asia-Pacific Journal of Operational Research, 20, 1, 1-20.
Alfares, H.K. (2006), Compressed workweek scheduling with days-off consecutivity, weekend-off frequency, and work stretch constraints,INFOR, in press.
Gaffin Jeffrey A
Gonzales Vincent
King Fahd University of Petroleum and Minerals
Litman Richard C.
LandOfFree
Cyclic combinatorial method and system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cyclic combinatorial method and system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclic combinatorial method and system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4254362