The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm (Q5962398)
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: The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm |
scientific article; zbMATH DE number 5789942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm |
scientific article; zbMATH DE number 5789942 |
Statements
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm (English)
0 references
22 September 2010
0 references
single machine
0 references
common due date
0 references
earliness and tardiness
0 references
lower bound
0 references
branch-and-bound
0 references
0.916348934173584
0 references
0.8881165385246277
0 references
0.8815618753433228
0 references
0.8812879920005798
0 references
