Two-machine flow shop scheduling problems with minimal and maximal delays (Q862809)
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: Two-machine flow shop scheduling problems with minimal and maximal delays |
scientific article; zbMATH DE number 5118370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow shop scheduling problems with minimal and maximal delays |
scientific article; zbMATH DE number 5118370 |
Statements
Two-machine flow shop scheduling problems with minimal and maximal delays (English)
0 references
24 January 2007
0 references
Flow shop
0 references
branch-and-bound procedure
0 references
Max-Plus algebra
0 references
0.8720166087150574
0 references
0.8580307960510254
0 references
0.8471105098724365
0 references
0.8451262712478638
0 references
0.8407840132713318
0 references
