A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267)
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 procedure to minimize total tardiness on one machine with arbitrary release dates |
scientific article; zbMATH DE number 2085609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates |
scientific article; zbMATH DE number 2085609 |
Statements
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (English)
0 references
10 August 2004
0 references
Scheduling
0 references
Single machine
0 references
Total tardiness
0 references
0 references
0.8876481056213379
0 references
0.8463851809501648
0 references
0.8386185169219971
0 references
0.8190038204193115
0 references
