A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185): Difference between revisions
From MaRDI portal
Created a new Item |
Removed claim: author (P16): Item:Q170009 |
||
| Property / author | |||
| Property / author: Chris N. Potts / rank | |||
Revision as of 06:39, 10 February 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
