Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems (Q1821677)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3999636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems |
scientific article; zbMATH DE number 3999636 |
Statements
Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems (English)
0 references
1986
0 references
The dynamic programming method which minimizes the number of stations for a given cycle time is extended here to solve two variants of the assembly-line balancing problem. The extended method minimizes cycle time for a given number of stations or, more generally, computes all nondominated pairs of cycle time and number of stations. The method is also applied to the stochastic case where minimizing critical cycle time, the number of stations and maximizing confidence level is desired.
0 references
assembly-line balancing problem
0 references
nondominated pairs of cycle time and number of stations
0 references
stochastic case
0 references
0 references
0.9584679
0 references
0.9240689
0 references
0.9176902
0 references
0.91028607
0 references
0.90299666
0 references
0.88971996
0 references
0.88807225
0 references
0.88796943
0 references
