Alpha-chain constraints for process planning

• US 9,076,116 B2
• Filed: 02/04/2013
• Issued: 07/07/2015
• Est. Priority Date: 02/04/2013
• Status: Active Grant

• Current Assignee: The Boeing Co.
• Original Assignee: The Boeing Co.
• Inventors: Furbeck, Warren R., Grose, David L., Sherer, Thomas E., Button, Scott D.
• Primary Examiner(s): Singh, Gurkanwaljit
• Application Number:
  US13/758,353
• Publication Number:
  US 20140222492A1
• Time in Patent Office: 883 Days
• Field of Search: 700/97, 705/7.11, 709/223, 709/231
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work

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.

Claims

1. An apparatus for implementation of an process-planning system, the apparatus comprising a processor and a memory storing executable instructions that in response to execution by the processor, cause the apparatus to implement at least:

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.

2. The apparatus of claim 1, wherein the schedule modeler further includes a duration calculator configured to calculate an average duration for the closure portions based on a time-frame constraint, and

wherein the scheduler constructor is configured to temporally sequence the closure portions according to the calculated average duration.

3. The apparatus of claim 2, wherein the duration calculator is also configured to calculate a size of a buffer corresponding to its duration, and

wherein scheduler constructor is further configured to temporally sequence the buffer after a last of the closure portions.

4. The apparatus of claim 2, wherein the closure portions have respective durations based on which the average duration is calculated, the durations being expressed as unknown probability distributions.

5. The apparatus of claim 1, wherein the tasks are arranged in a plurality of chains of logically-sequenced tasks, and

wherein the task separator is configured to separate the respective tasks, and schedule constructor is configured to temporally sequence the closure portions and prepend the precursor portions, for each of the chains.

6. The apparatus of claim 1, wherein the memory stores further executable instructions that, in response to execution by the processor, cause the apparatus to further implement:

a plan modeler configured to compile at least the process-related information and plan schedule into a plan model.

7. The apparatus of claim 1, wherein the memory stores further executable instructions that, in response to execution by the processor, cause the apparatus to further implement:

a total-ordering system coupled to the schedule modeler and configured to establish total-ordering in the process, the received process-related information based on which the schedule is constructed being for the total-ordered process.

22. The apparatus of claim 1, wherein each of the tasks is composed of one or more activities, and for each of the at least some of the respective tasks separated into a closure portion and distinct precursor portion, each of the closure portion and precursor portion is composed of one or more activities of its task.

23. The apparatus of claim 1, wherein the tasks are arranged in a plurality of chains, a first chain of which includes strictly-ordered tasks without flexibility in their order, and a second chain of which includes tasks with at least some flexibility in their order, and

wherein the apparatus is caused to separate each of at least some of the respective tasks, and temporally sequence the closure portions, on a per-chain basis.

24. The apparatus of claim 23, wherein the memory stores further executable instructions that in response to execution by the processor cause the apparatus to further:

compile at least the process-related information and plan schedule into a plan model, wherein the temporally-sequenced closure portions for the first chain function as a constraint to the plan model.

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.

9. The method of claim 8, wherein constructing the process schedule further comprises calculating an average duration for the closure portions based on a time-frame constraint, and

wherein the closure portions are temporally sequenced according to the calculated average duration.

10. The method of claim 9, wherein calculating the average duration also includes calculating a size of a buffer corresponding to its duration, and

wherein temporally sequencing the closure portions further includes temporally sequencing the buffer after a last of the closure portions.

11. The method of claim 9, wherein the closure portions have respective durations based on which the average duration is calculated, the durations being expressed as unknown probability distributions.

12. The method of claim 8, wherein the tasks are arranged in a plurality of chains of logically-sequenced tasks, and

wherein construction of the process schedule includes separating the respective tasks, temporally sequencing the closure portions and prepending the precursor portions for each of the chains.

13. The method of claim 8 further comprising:

compiling at least the process-related information and plan schedule into a plan model.

14. The method of claim 8 further comprising:

establishing total-ordering in the process, the received process-related information based on which the schedule is constructed being for the total-ordered process.

15. A computer-readable storage medium that is non-transitory and has 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.

16. The computer-readable storage medium of claim 15, wherein the apparatus being caused to construct the process schedule further includes being caused to calculate an average duration for the closure portions based on a time-frame constraint, and

wherein the apparatus is caused to temporally sequence the closure portions according to the calculated average duration.

17. The computer-readable storage medium of claim 16, wherein the apparatus being caused to calculate the average duration also includes being caused to calculate a size of a buffer corresponding to its duration, and

wherein the apparatus being caused to temporally sequence the closure portions further includes being caused to temporally sequence the buffer after a last of the closure portions.

18. The computer-readable storage medium of claim 16, wherein the closure portions have respective durations based on which the average duration is calculated, the durations being expressed as unknown probability distributions.

19. The computer-readable storage medium of claim 15, wherein the tasks are arranged in a plurality of chains of logically-sequenced tasks, and

wherein construction of the process schedule includes the apparatus being caused to separate the respective tasks, temporally sequence the closure portions and prepend the precursor portions for each of the chains.

20. The computer-readable storage medium of claim 15 having further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:

compile at least the process-related information and plan schedule into a plan model.

21. The computer-readable storage medium of claim 15 having further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:

establish total-ordering in the process, the received process-related information based on which the schedule is constructed being for the total-ordered process.