A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00312-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088786941 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the two-stage assembly scheduling problem |
scientific article |
Statements
A branch and bound algorithm for the two-stage assembly scheduling problem (English)
0 references
6 October 1999
0 references
branch and bound
0 references
two-stage assembly scheduling
0 references
maximum completion time
0 references
makespan
0 references
0 references
0 references
