Minimizing total tardiness in permutation flowshops (Q1127155)
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: Minimizing total tardiness in permutation flowshops |
scientific article; zbMATH DE number 1189540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total tardiness in permutation flowshops |
scientific article; zbMATH DE number 1189540 |
Statements
Minimizing total tardiness in permutation flowshops (English)
0 references
13 August 1998
0 references
permutation flowshop scheduling
0 references
total tardiness
0 references
branch-and-bound
0 references
0 references
0 references
0.9506751
0 references
0.94377685
0 references
0.9396383
0 references
0.9389733
0 references
0.9386872
0 references
0 references
0.92982316
0 references
0.92716104
0 references
0.9221682
0 references
0.92127246
0 references
