System for modeling production of a product

• US 9,792,573 B2
• Filed: 06/10/2015
• Issued: 10/17/2017
• Est. Priority Date: 02/04/2013
• Status: Active Grant

• Current Assignee: The Boeing Co.
• Original Assignee: The Boeing Co.
• Inventors: Furbeck, Warren Rees, Button, Scott D., Heitmeyer, Richard, Sherer, Thomas Edward
• Primary Examiner(s): Singh, Gurkanwaljit
• Application Number:
  US14/735,948
• Publication Number:
  US 20150310359A1
• Time in Patent Office: 860 Days
• Field of Search: None
• CPC Class Codes: G05B 19/41865 characterised by job scheduling, process planning, material flow
• 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/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/067 Enterprise or organisation modelling
• CPC Class Codes: G06Q 50/04 Manufacturing
• CPC Class Codes: Y02P 90/30 Computing systems specially adapted for manufacturing

Abstract

A method is provided that includes receiving process-related information describing a logical sequence of tasks to produce respective internal products of a process for production of a product. At least some of the tasks have a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task. The method includes for at least some of the tasks, separating each of the at least some of the 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 constructing a schedule for execution of the at least some of the tasks. Construction of the schedule includes temporally sequencing the closure portions of the respective tasks without intervening precursor portions, and prepending the precursor portions to respective, temporally-sequenced closure portions.

Claims

1. An apparatus for implementation of at least a schedule modeler, the apparatus comprising:

a processor; and

a memory storing 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 memory further stores executable instructions that, in response to execution by the processor, cause the apparatus to implement at least;

a task separator accessing the process-related information from the memory and, for at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, separating each of the at least some of the 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 schedule constructor constructing a schedule for execution of the at least some of the tasks, including the schedule constructor at least;

temporally sequencing the closure portions of the respective tasks without intervening precursor portions; and

prepending the precursor portions to respective, temporally-sequenced closure portions.

2. 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.

3. 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 duration calculator calculating an average duration for the closure portions, the schedule constructor temporally sequencing the closure portions according to the calculated average duration.

4. The apparatus of claim 1, wherein the schedule constructor constructing the schedule includes constructing the schedule according to a critical path or critical chain algorithm.

5. The apparatus of claim 1, wherein the schedule constructor constructing the schedule includes constructing the schedule according to an alpha chain algorithm.

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 compiling at least the process-related information and schedule into a plan model.

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

a multi-project scheduler constructing a multi-project schedule based on the plan model in which the at least some of the tasks are spread across multiple projects in a multi-project environment, wherein the multi-project scheduler constructing the multi-project schedule includes staggering the at least some of the tasks based on a drum resource or virtual drum identifiable from the process-related information.

8. A method comprising:

storing, in a memory, 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

by a processor accessing the process-related information from the memory,

for at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, separating each of the at least some of the 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

constructing a schedule for execution of the at least some of the tasks, construction of the schedule including;

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 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.

10. The method of claim 8 further comprising:

calculating an average duration for the closure portions, the closure portions being temporally sequenced according to the calculated average duration.

11. The method of claim 8, wherein constructing the schedule includes constructing the schedule according to a critical path or critical chain algorithm.

12. The method of claim 8, wherein constructing the schedule includes constructing the schedule according to an alpha chain algorithm.

13. The method of claim 8 further comprising:

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

14. The method of claim 13 further comprising:

constructing a multi-project schedule based on the plan model in which the at least some of the tasks are spread across multiple projects in a multi-project environment, wherein constructing the multi-project schedule includes staggering the at least some of the tasks based on a drum resource or virtual drum identifiable from the process-related information.

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 perform operations including at least:

accessing process-related information from a memory, the 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

for at least some of the tasks each of which utilizes or requires one or more inputs including temporally at least a last input, separating each of the at least some of the 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

constructing a schedule for execution of the at least some of the tasks, including the at least;

temporally sequencing the closure portions of the respective tasks without intervening precursor portions; and

prepending the precursor portions to respective, temporally-sequenced closure portions.

16. The computer-readable storage medium of claim 15, 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.

17. The computer-readable storage medium of claim 15, wherein the apparatus is caused to perform operations further including:

calculating an average duration for the closure portions, the apparatus being caused to temporally sequence the closure portions according to the calculated average duration.

18. The computer-readable storage medium of claim 15, wherein constructing the schedule includes constructing the schedule according to a critical path or critical chain algorithm.

19. The computer-readable storage medium of claim 15, wherein constructing the schedule includes constructing the schedule according to an alpha chain algorithm.

20. The computer-readable storage medium of claim 15, wherein the apparatus is caused to perform operations further including:

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

21. The computer-readable storage medium of claim 20, wherein the apparatus is caused to perform operations further including:

constructing a multi-project schedule based on the plan model in which the at least some of the tasks are spread across multiple projects in a multi-project environment, wherein constructing the multi-project schedule includes staggering the at least some of the tasks based on a drum resource or virtual drum identifiable from the process-related information.