A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:21, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem |
scientific article |
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
