Alpha-Chain Constraints For Process Planning
First Claim
1. A process-planning system comprising:
- a schedule modeler configured to receive process-related information describing a process for production of a product, the process-related information describing a logical sequence of tasks to produce respective internal products of the process, at least some of the tasks having a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task,wherein the schedule modeler is also configured to construct a schedule for the process based on the process-related information, the process schedule being for execution of at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, the schedule modeler including;
a task separator configured to separate each of at least some of the respective tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available; and
a scheduler constructor configured to temporally sequence the closure portions of the respective tasks without intervening precursor portions, and prepend the precursor portions to respective, temporally-sequenced closure portions.
1 Assignment
0 Petitions
Accused Products
Abstract
A method is provided that includes receiving process-related information describing a process for production of a product, including a logical sequence of tasks to produce respective internal products of the process. The method also includes constructing a schedule for the process based on the process-related information, with the process schedule being for execution of at least some of the tasks each of which utilizes or requires inputs including temporally a last input. Construction of the process schedule includes separating each of at least some of the respective tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available. The closure portions of the respective tasks may be temporally sequenced without intervening precursor portions, and the precursor portions may be prepended to respective, temporally-sequenced closure portions.
-
Citations
21 Claims
-
1. A process-planning system comprising:
-
a schedule modeler configured to receive process-related information describing a process for production of a product, the process-related information describing a logical sequence of tasks to produce respective internal products of the process, at least some of the tasks having a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task, wherein the schedule modeler is also configured to construct a schedule for the process based on the process-related information, the process schedule being for execution of at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, the schedule modeler including; a task separator configured to separate each of at least some of the respective tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available; and a scheduler constructor configured to temporally sequence the closure portions of the respective tasks without intervening precursor portions, and prepend the precursor portions to respective, temporally-sequenced closure portions. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method comprising:
-
receiving process-related information describing a process for production of a product, the process-related information describing a logical sequence of tasks to produce respective internal products of the process, at least some of the tasks having a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task; and constructing a schedule for the process based on the process-related information, the process schedule being for execution of at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, construction of the process schedule including; separating each of at least some of the respective tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available; temporally sequencing the closure portions of the respective tasks without intervening precursor portions; and prepending the precursor portions to respective, temporally-sequenced closure portions. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A computer-readable storage medium having computer-readable program code portions stored therein that, in response to execution by a processor, cause an apparatus to at least:
-
receive process-related information describing a process for production of a product, the process-related information describing a logical sequence of tasks to produce respective internal products of the process, at least some of the tasks having a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task; and construct a schedule for the process based on the process-related information, the process schedule being for execution of at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, construction of the process schedule including the apparatus being caused to at least; separate each of at least some of the respective tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available; temporally sequence the closure portions of the respective tasks without intervening precursor portions; and prepend the precursor portions to respective, temporally-sequenced closure portions. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
Specification