A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints |
scientific article; zbMATH DE number 5571394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints |
scientific article; zbMATH DE number 5571394 |
Statements
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (English)
0 references
29 June 2009
0 references
scheduling
0 references
two-machine flowshop
0 references
limited waiting time
0 references
makespan
0 references
0.8974397778511047
0 references
0.836178183555603
0 references
0.8327798247337341
0 references
0.8322563767433167
0 references
