Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (Q1960313)
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 1385916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs |
scientific article; zbMATH DE number 1385916 |
Statements
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (English)
0 references
11 January 2000
0 references
branch and bound algorithm
0 references
single-machine scheduling
0 references
maximum tardiness
0 references
tardy jobs
0 references
0.8851450085639954
0 references
0.8709983229637146
0 references
0.8617892861366272
0 references
0.8588070869445801
0 references
0.851639986038208
0 references
