A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579)
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 faster branch-and-bound algorithm for the earliness-tardiness scheduling problem |
scientific article; zbMATH DE number 5599842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem |
scientific article; zbMATH DE number 5599842 |
Statements
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (English)
0 references
28 August 2009
0 references
one-machine scheduling
0 references
earliness-tardiness
0 references
Lagrangean relaxation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
