Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Operations research or analysis
Reexamination Certificate
2011-04-19
2011-04-19
Choi, Peter (Department: 3623)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Operations research or analysis
Reexamination Certificate
active
07930198
ABSTRACT:
A method for scheduling a project such as the inspection and maintenance of a gas turbine utilizes a branch and bound technique for arriving at a solution. The branch and bound technique is improved by using an all-pair longest path algorithm in preprocessing to tighten the set of possible start times of the tasks. That set is further tightened by considering two-forbidden-task pairs; i.e., pairs of tasks that cannot execute at the same time due to conflicting resource needs. A hard lower bound of a branch is determined by using all-pair longest path update and two-forbidden-task pair update, reducing the need to recalculate.
REFERENCES:
patent: 6044361 (2000-03-01), Kalagnanam et al.
patent: 2004/0024686 (2004-02-01), Sandholm et al.
Perregaard, Michael; Clausen, Jens. “Parallel Branch-and-Bound Methods for the Job-Shop Scheduling Problem”. Jun. 29, 1998.
Zivan Roie; Meisels, Amnon. “Conflict Based Backjumping for Constraints Optimization Problems”.
Franck, Birger; Neumann, Klaus; Schwindt, Christoph. “Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling”. 2001. OR Spektrum.
Dell'Amico, Mauro; Iori, Manuel; Martello, Silvano. “Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem”. 2004. Journal of Heuristics. Issue 10. pp. 169-204.
Demeulemmester, Erik L; Herroeln, Willy S. “A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem”. Mar.-Apr. 1997. Operations Research. vol. 45, Issue 2. pp. 201-212.
Cao, B. “Transportation Problem with Nonlinear Side Constraints a Branch and Bound Approach”. 1992. Methods and Models of Operations Research. vol. 36. pp. 185-197.
Kramer, Andreas. “Branch and Bound Methods for Scheduling Problems with Multiprocessor Tasks on Dedicated Processors”. 1997. OR Spektrum. Issue 18. pp. 219-227.
Yamashita, Denise Sato.; Armentano, Vinicius Amaral; Laguna, Manuel. “Scatter Search for Project Scheduling With Resource Availability Cost”. Mar. 13, 2004.
“Project Scheduling with Time Windows and Scarce Resources”, Neumann et al., Second Edition, Springer, 2003, pp. 34-39, 56-57 and 282-283.
“Scheduling Project Networks with Resource Constraints and Time Windows”, Bartusch et al., Annals of Operations Research, 16, (1988), pp. 201-240.
“A Branch-and-bound Procedure for the Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations”, De Reyck et al., European Journal of Operational Research 111 (1988), pp. 152-174.
“A Hybrid Scatter Search/Electromagnetism Meta-Heuristic for Project Scheduling”, Debels et al., European Journal of Operational Research (2004).
Chakraborty Amit
Yin Watao
Choi Peter
Siemens Corporation
LandOfFree
Maintenance event planning and scheduling for gas turbines does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Maintenance event planning and scheduling for gas turbines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maintenance event planning and scheduling for gas turbines will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2715785