Patent US6347256B1 successfully refreshed from Google Patents.
US6347256B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Manufacturing process modeling techniques
Assignee: PRINTCAFE Inc
•
Filing: 1998-11-02
•
Granted: 2002-02-12
•
Expires: 2018-11-02
Abstract
Abstract A directed graph includes a first number of state nodes and a second number of task nodes. The task nodes are interconnected with the state nodes to define one or more paths through the directed graph, each of the paths including an alternating series of one or more of the state nodes and one or more of the task nodes. Thus, any predecessor state node in one of the paths represents a precondition for a subsequent task node along that path. Further, any following state node of that task node represents a result of applying one or more actions that correspond to the task node. The state nodes may be virtual representations of inventory items of a manufacturing environment. Thus, collectively the state nodes may define a bill of materials for the manufacturing environment. Similarly, the task nodes may each define a virtual representation of a manufacturing process within the manufacturing environment. In other words, the task nodes may collectively define routings for the manufacturing environment.
Inventors
- 👤 Yuri V. Smirnov
- 👤 Phillip C. Nelson
- 👤 Jeffrey B. Winner
- 👤 Yuh-Wen Soung
- 👤 John L. Flight
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:42
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
126 words
A directed graph, comprising: a first number of state nodes, at least some of which comprise virtual representations of inventory items of a manufacturing environment; and a second number of task nodes interconnected with the state nodes to define one or more paths through the directed graph, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node.
Claim 2
Dependent Claim
126 words
A directed graph, comprising: a first number of state nodes, at least some of which comprise virtual representations of inventory items of a manufacturing environment; and a second number of task nodes interconnected with the state nodes to define one or more paths through the directed graph, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node.
Claim 3
Dependent Claim
21 words
The directed graph of claim 1 wherein all the state nodes comprise virtual representations of inventory items of a manufacturing environment.
Claim 4
Dependent Claim
38 words
The directed graph of claim 1 wherein at least a subset of the first number of state nodes as arranged in the hierarchy defined by the directed graph collectively define a bill of materials for the manufacturing environment.
Claim 5
Dependent Claim
23 words
The directed graph of claim 3 wherein the subset of the first number of state nodes define a route through the directed graph.
Claim 6
Dependent Claim
23 words
The directed graph of claim 3 wherein each of the second number of task nodes defines a virtual representation of a manufacturing process.
Claim 7
Dependent Claim
20 words
The directed graph of claim 3 wherein the second number of task nodes collectively define routings for the manufacturing environment.
Claim 8
Dependent Claim
20 words
The directed graph of claim 5 wherein individual ones of the routings define bills of resources for the manufacturing environment.
Claim 9
Dependent Claim
24 words
The directed graph of claim 3 wherein the second number of task nodes collectively define a group of reusable resources for the manufacturing environment.
Claim 10
Independent Claim
158 words
A method of modeling a manufacturing environment, comprising: representing a final product of the manufacturing process with a first state node of a directed graph; and representing each of one or more manufacturing processes required in the production of the final product and the corresponding preconditions thereto and results produced thereby as a number of corresponding task nodes and state nodes, the task nodes representing the manufacturing processes of the manufacturing environment and the state nodes, at least some of which represent inventory items of a manufacturing environment, representing the preconditions thereto and the results produced thereby, the task nodes and state nodes arranged within the directed graph such that inputs to each of the task nodes represent required states therefor and outputs of each of the task nodes represent alternative states produced thereby, the first state node representing the output of one or more of the manufacturing processes represented by one or more of the task nodes.
Claim 11
Independent Claim
158 words
A method of modeling a manufacturing environment, comprising: representing a final product of the manufacturing process with a first state node of a directed graph; and representing each of one or more manufacturing processes required in the production of the final product and the corresponding preconditions thereto and results produced thereby as a number of corresponding task nodes and state nodes, the task nodes representing the manufacturing processes of the manufacturing environment and the state nodes, at least some of which represent inventory items of a manufacturing environment, representing the preconditions thereto and the results produced thereby, the task nodes and state nodes arranged within the directed graph such that inputs to each of the task nodes represent required states therefor and outputs of each of the task nodes represent alternative states produced thereby, the first state node representing the output of one or more of the manufacturing processes represented by one or more of the task nodes.
Claim 12
Dependent Claim
19 words
The method of claim 9 wherein the task nodes represent processes associated with reusable resources for the manufacturing environment.
Claim 13
Dependent Claim
23 words
The method of claim 9 wherein the task nodes represent manufacturing processes that use reusable resources and consumable resources from the manufacturing environment.
Claim 14
Dependent Claim
33 words
The method of claim 9 wherein the state nodes are arranged in a hierarchy defined by the directed graph so as to comprise one or more bills of material for the manufacturing environment.
Claim 15
Dependent Claim
41 words
The method of claim 12 wherein task nodes alternate with state nodes along each of a number of routes through the directed graph, each path defining a way in which the final product may be produced in t he manufacturing environment.
Claim 16
Dependent Claim
167 words
A computer assisted scheduling system, comprising: a model of a real-world manufacturing environment arranged as a direct graph and including a first number of state nodes, at least some of which represent inventory items of the manufacturing environment, and a second number of task nodes interconnected with the state nodes to define one or more paths through the directed graph, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node; and a scheduler configured to determine which of the paths through the direct graph to provide as a workflow in response to a tasking for the manufacturing environment.
Claim 17
Dependent Claim
167 words
A computer assisted scheduling system, comprising: a model of a real-world manufacturing environment arranged as a direct graph and including a first number of state nodes, at least some of which represent inventory items of the manufacturing environment, and a second number of task nodes interconnected with the state nodes to define one or more paths through the directed graph, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node; and a scheduler configured to determine which of the paths through the direct graph to provide as a workflow in response to a tasking for the manufacturing environment.
Claim 18
Dependent Claim
24 words
The system of claim 14 further comprising means for receiving updates from the real-world manufacturing environment, the updates representing changes in the manufacturing environment.
Claim 19
Dependent Claim
11 words
The system of claim 15 wherein the changes comprise completed tasks.
Claim 20
Dependent Claim
28 words
The system of claim 15 wherein the changes comprise a change in the availability of one or more resources associated with one or more of the task nodes.
References Cited (Backward Citations)
US3581072A
Cited
US3703006A
Cited
US3703725A
Cited
UST918004I4
Cited
US3905045A
Cited
US3930251A
Cited
US4007362A
Cited
US3988570A
Cited
US4017831A
Cited
US4231096A
Cited
US4468750A
Cited
US4433426A
Cited
US4400783A
Cited
US4484522A
Cited
US4449186A
Cited
US4475756A
Cited
US4495582A
Cited
US4601003A
Cited
US4584648A
Cited
US4578768A
Cited
US4578768B1
Cited
US4648023A
Cited
US4796194A
Cited
US4839829A
Cited
US5053970A
Cited
US5016170A
Cited
US5233533A
Cited
US5291394A
Cited
US5278750A
Cited
US5748899A
Cited
US5229948A
Cited
US5406476A
Cited
EP0517953A2
Cited
US5291397A
Cited
US5287194A
Cited
US5436843A
Cited
US5432887A
Cited
US5574640A
Cited
US5463555A
Cited
US5734837A
Cited
US5592602A
Cited
US6088626A
Cited
US5768506A
Cited
WO1996010793A1
Cited
WO1996016365A2
Cited
US5557367A
Cited
US5504568A
Cited
US5757669A
Cited
JPH0934953A
Cited
WO1997007472A1
Cited
US5946663A
Cited
US5754857A
Cited
US5778364A
Cited
WO1997028506A1
Cited
WO1997029441A1
Cited
WO1997031322A1
Cited
US5765139A
Cited
US6058334A
Cited
US5794207A
Cited
US5729790A
Cited
US5983195A
Cited
JPH11110451A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-02-11 | 2005-08-13 | 2006-02-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-02-11 | 2009-08-13 | 2010-02-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-02-11 | 2013-08-13 | 2014-02-12 | $7700.00 | Window Closed / Lapsed |