Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems (Q1821677): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:48, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems |
scientific article |
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
