A branch-bound algorithm to minimize the maximum tardiness with minimum number tardy (Q3640879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5630324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-bound algorithm to minimize the maximum tardiness with minimum number tardy |
scientific article; zbMATH DE number 5630324 |
Statements
11 November 2009
0 references
scheduling
0 references
tardiness
0 references
branch-bound algorithm
0 references
0.8169100284576416
0 references
0.810417115688324
0 references
0.8066377639770508
0 references
