US5177688A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Assembly line balancer
Assignee: Texas Instruments Inc
•
Filing: 1992-01-13
•
Granted: 1993-01-05
•
Expires: 2012-01-13
Abstract
Abstract Assembly line balancer groups tasks of multi-sided, mixed model assembly lines on the basis of per side and per model constraints. Resulting compound tasks involve less computational time and power in balancing the line.
Inventors
- 👤 David Rentschler
- 👤 David B. Stevens
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 13:22
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06; G05; G05B; G05B19/00; G05B19/02; G05B19/418; G05B19/41835; G05B2219/00; G05B2219/30; G05B2219/32; G05B2219/32056; Y; Y02; Y02P; Y02P90/00; Y02P90/02
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
151 words
A method for balancing the assignment of a plurality of tasks to a plurality of workstations, comprising the steps of: (a) providing a plurality of partially ordered sets of tasks, each of which tasks has an assigned task time; (b) linearly ordering each of said sets by a ranking technique based on said task times; (c) grouping a plurality of said tasks between said sets on the basis of a first class of constraints; (d) linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering; and (e) selecting for assignment to workstations groups of tasks in order of their rank and without violating a first plurality of constraints, wherein each of said workstations has a cycle time.
Claim 2
Independent Claim
151 words
A method for balancing the assignment of a plurality of tasks to a plurality of workstations, comprising the steps of: (a) providing a plurality of partially ordered sets of tasks, each of which tasks has an assigned task time; (b) linearly ordering each of said sets by a ranking technique based on said task times; (c) grouping a plurality of said tasks between said sets on the basis of a first class of constraints; (d) linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering; and (e) selecting for assignment to workstations groups of tasks in order of their rank and without violating a first plurality of constraints, wherein each of said workstations has a cycle time.
Claim 3
Dependent Claim
28 words
The method of claim 1 wherein said ranking technique ranks said tasks by said task time plus the sum of all said task times of all subsequent tasks.
Claim 4
Dependent Claim
38 words
The method of claim 1 comprising the further steps of: (a) repeating the steps (b)-(e) at least once with a different cycle time for each repetition; and (b) selecting one of the resulting assignments of tasks to workstations.
Claim 5
Dependent Claim
92 words
The method of claim 1, comprising the further steps of: (f) regrouping a plurality of said tasks between said sets on the basis of a second class of constraints; and (g) second linearly reordering each of said task sets of a ranking technique based on said task times wherein the rank of a task in one of said regroups is replaced by the maximum of the ranks of the tasks in said regroup of step (f) during said second reordering; (h) wherein step (e) applies to said regroups instead of said groups.
Claim 6
Dependent Claim
29 words
The method of claim 4 wherein said second ranking technique ranks said tasks by said task time plus the sum of all said task times of all subsequent tasks.
Claim 7
Dependent Claim
40 words
The method of steps (a)-(b) of claim 4 comprising the further steps of: (a) repeating the steps at least once with a different cycle time for each repetition; and (b) selecting one of the resulting assignments of tasks to workstations.
Claim 8
Dependent Claim
22 words
The method of claim 4, wherein said ranking technique of step (g) is the same as the ranking technique of step (d).
Claim 9
Dependent Claim
40 words
The method of steps (b)-(e) of claim 1 comprising the further steps of: (a) repeating the steps at least once with a different cycle time for each repetition; and (b) selecting one of the resulting assignments of tasks to workstations.
Claim 10
Dependent Claim
99 words
The method of claim 1, further comprising the step of displaying a range of possible outcomes of an assembly line balance by providing at least one of a plurality of displays, said plurality including: (i) a display of the number of required workstations and the cumulative idle time for an input range of cycle times; (ii) a display of the required cycle time and the cumulative idle time for an input range of the number of required workstations; (iii) a display of the number of required workstations and the cumulative idle time for an input range of production rates.
Claim 11
Independent Claim
152 words
A system for assembly line balancing the assignment of a plurality of tasks for a plurality of models of a product to a plurality of workstations based on precedence and grouping constraints, comprising: (a) a knowledge base wherein task parameters and said precedence and grouping constraints are input and stored; and (b) processing circuitry coupled to said knowledge base for linearly ordering each of said tasks by a ranking technique based on said task parameters, grouping of a plurality of said tasks on the basis of said grouping constraints, linearly reordering of each of said tasks by a ranking technique wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering, and selecting for assignment to said workstations of groups of tasks in order of their rank and without violating said precedence and grouping constraints.
Claim 12
Independent Claim
152 words
A system for assembly line balancing the assignment of a plurality of tasks for a plurality of models of a product to a plurality of workstations based on precedence and grouping constraints, comprising: (a) a knowledge base wherein task parameters and said precedence and grouping constraints are input and stored; and (b) processing circuitry coupled to said knowledge base for linearly ordering each of said tasks by a ranking technique based on said task parameters, grouping of a plurality of said tasks on the basis of said grouping constraints, linearly reordering of each of said tasks by a ranking technique wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering, and selecting for assignment to said workstations of groups of tasks in order of their rank and without violating said precedence and grouping constraints.
Claim 13
Independent Claim
249 words
A method for balancing the assignment of a plurality of tasks to a plurality of workstations, wherein said tasks are for a plurality of models of a product, each of which models has a plurality of sides, comprising the steps of: (a) providing for each of said sides of each of said models a partially ordered sets of tasks, each of which tasks has an assigned task time; (b) linearly ordering each of said sets by a ranking technique based on said task times; (c) grouping a plurality of said tasks between said sides on the basis of a first class of constraints; (d) linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering; (e) regrouping a plurality of said tasks between said models on the basis of a second class of constraints; (f) second linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said regroups is replaced by the maximum of the ranks of the tasks in said regroup of step (e) during said second ranking; and (g) selecting for assignment to workstations regroups of tasks in order of their rank and without violating a first plurality of constraints, wherein each of said workstations has a cycle time.
Claim 14
Independent Claim
249 words
A method for balancing the assignment of a plurality of tasks to a plurality of workstations, wherein said tasks are for a plurality of models of a product, each of which models has a plurality of sides, comprising the steps of: (a) providing for each of said sides of each of said models a partially ordered sets of tasks, each of which tasks has an assigned task time; (b) linearly ordering each of said sets by a ranking technique based on said task times; (c) grouping a plurality of said tasks between said sides on the basis of a first class of constraints; (d) linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said groups is replaced by the maximum of the ranks of the tasks in said group during said reordering; (e) regrouping a plurality of said tasks between said models on the basis of a second class of constraints; (f) second linearly reordering each of said task sets by a ranking technique based on said task times wherein the rank of a task in one of said regroups is replaced by the maximum of the ranks of the tasks in said regroup of step (e) during said second ranking; and (g) selecting for assignment to workstations regroups of tasks in order of their rank and without violating a first plurality of constraints, wherein each of said workstations has a cycle time.
Claim 15
Dependent Claim
27 words
The method of claim 11 wherein said ranking technique ranks said tasks by said task time plus the sum of said task times of all subsequent tasks.
Claim 16
Dependent Claim
16 words
The method of claim 11 wherein said cycle time is equal for all of said workstations.
Claim 17
Dependent Claim
29 words
The method of claim 11 wherein, given n workstations running in parallel, and a nominal cycle time T, the cycle time of each of said n workstations is n×T.
Claim 18
Dependent Claim
22 words
The method of claim 11, wherein said ranking technique of step (d) is the same as the ranking technique of step (f).
Claim 19
Dependent Claim
99 words
The method of claim 7, further comprising the step of displaying a range of possible outcomes of an assembly line balance by providing at least one of a plurality of displays, said plurality including: (i) a display of the number of required workstations and the cumulative idle time for an input range of cycle times; (ii) a display of the required cycle time and the cumulative idle time for an input range of the number of required workstations; (iii) a display of the number of required workstations and the cumulative idle time for an input range of production rates.
References Cited (Backward Citations)
US4459663A
Cited
US4561060A
Cited
US4591983A
Cited
US4802094A
Cited
US4747130A
Cited
US4958292A
Cited
US4937755A
Cited
US4994980A
Cited
US5053970A
Cited
US4887218A
Cited
US4942527A
Cited
US4896269A
Cited
US4931944A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-01-05 | 1996-07-06 | 1997-01-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-01-05 | 2000-07-06 | 2001-01-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-01-05 | 2004-07-06 | 2005-01-05 | $7700.00 | Window Closed / Lapsed |