Continuous caster scheduling with template driven search
AssigneeInternational Business Machines Corporation
InventorToshiyuki Hama
Life of this patent
Estimating the term…
Abstract
Methods and systems for scheduling include forming a search tree. Each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score. The search tree is searched for a path having an optimal associated priority score. A schedule is implemented based on the path having the optimal associated priority score.
Claims20
A computer-implemented method for scheduling, comprising:
- forming a search tree using a processor, wherein each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score;
- searching the search tree for a path having an optimal associated priority score;
- and
- implementing a schedule based on the path having the optimal associated priority score.
A non-transitory computer readable storage medium comprising a computer readable program for scheduling, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
- forming a search tree using a processor, wherein each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score;
- searching the search tree for a path having an optimal associated priority score;
- and
- implementing a schedule based on the path having the optimal associated priority score.
A system for scheduling, comprising:
- a search module comprising a processor configured to form a search tree and to search the search tree for a path having an optimal associated priority score, wherein each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score;
- and
- a control module configured to implement a schedule based on the path having the optimal associated priority score.
Dependencies are inferred from the claim text.