A competitive branch-and-bound algorithm for the simple assembly line balancing problem (Q4497013): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/002075499191003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2165243802 / rank | |||
Normal rank | |||
Latest revision as of 02:23, 20 March 2024
scientific article; zbMATH DE number 1493711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A competitive branch-and-bound algorithm for the simple assembly line balancing problem |
scientific article; zbMATH DE number 1493711 |
Statements
A competitive branch-and-bound algorithm for the simple assembly line balancing problem (English)
0 references
21 August 2000
0 references
