Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Operations research or analysis
Reexamination Certificate
2011-08-02
2011-08-02
Kramer, James (Department: 3693)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Operations research or analysis
C705S007120, C705S007110
Reexamination Certificate
active
07991633
ABSTRACT:
Increased efficiency and lower cost job scheduling is provided by a system and method that optimizes for cost instead of makespan, and minimizes fluctuations in resource utilization. A schedule is constructed using a workflow scheduling system that includes a load leveler, a cost minimizer, and a manpower planner. The load leveler minimizes makespan, subject to resource limits, and then lowers the resource limits, repeating the process in order to create a flatter schedule. The cost minimizer generates an initial solution, and then incrementally improves it, using the manpower planner to evaluate the different possible solutions. The manpower planner calculates, for a given schedule, the optimal hire/fire decisions to minimize total cost.
REFERENCES:
patent: 5291397 (1994-03-01), Powell
patent: 5524077 (1996-06-01), Faaland et al.
patent: 5548506 (1996-08-01), Srinivasan
patent: 5767848 (1998-06-01), Matsuzaki et al.
patent: 5911134 (1999-06-01), Castonguay et al.
patent: 6070144 (2000-05-01), Ginsberg et al.
patent: 6415259 (2002-07-01), Wolfinger et al.
patent: 6490566 (2002-12-01), Schmidt
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6678698 (2004-01-01), Fredell et al.
patent: 2001/0047274 (2001-11-01), Borton
patent: 2002/0052770 (2002-05-01), Podrazhansky
patent: 2002/0065702 (2002-05-01), Caulfield
(Smith) A. Cesta, A. Oddi, and Stephen Smith, “Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems,” Proceedings National Conference on Artificial Intelligence (AAAI-00), Jul. 2000.
(Amico) Dell'Amico, M. and Trubian, M. 1993. Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41, 1-4 (May 1993), 231-252.
(Stidsen) T. Stidsen, L. V. Kragelund, O. Mateescu, Jobshop Scheduling in a Shipyard, European Conference on Artificial Intelligence, Budapest, 1996.
A Heuristic Model for Scheduling Large Projects with Limited Resources Author(s): Jerome D. Wiest Source: Management Science, vol. 13, No. 6, Series B, Managerial (Feb. 1967), pp. B359-B377.
“A Heuristic Model for Scheduling Large Projects with Limited Resources” Jerome D Wiest Management Science, vol. 13, No. 6, Series B, Managerial (Feb. 1967).
Smith et al., “Slack-Based Heuristics for Constraint Satisfaction Scheduling”,AAAI-93 Proceedings(www.aaai.org), 139-144 (1993).
Baker Andrew B.
Ginsberg Matthew L.
Keith Daniel B.
Parkes Andrew
Smith Bryan
Fenwick & West LLP
Kramer James
On Time Systems, Inc.
Vezeris James
LandOfFree
System and process for job scheduling to minimize... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and process for job scheduling to minimize..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and process for job scheduling to minimize... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2731030