A new branch and bound algorithm for minimizing the weighted number of tardy jobs (Q2638922)
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 new branch and bound algorithm for minimizing the weighted number of tardy jobs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new branch and bound algorithm for minimizing the weighted number of tardy jobs |
scientific article |
Statements
A new branch and bound algorithm for minimizing the weighted number of tardy jobs (English)
0 references
1990
0 references
sequencing
0 references
single machine
0 references
weighted number of tardy jobs
0 references
branch-and- bound
0 references
0 references
0 references
