A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719)
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 branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem |
scientific article; zbMATH DE number 1341325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem |
scientific article; zbMATH DE number 1341325 |
Statements
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (English)
0 references
2 April 2001
0 references
scheduling
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
0.9763046
0 references
0 references
0.95574355
0 references
0.9529616
0 references
0.9503577
0 references
0.9453275
0 references
0.9317024
0 references
0.9193084
0 references
0.91855216
0 references
