A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951)
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 a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects |
scientific article; zbMATH DE number 6485503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects |
scientific article; zbMATH DE number 6485503 |
Statements
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (English)
0 references
25 September 2015
0 references
scheduling
0 references
single-machine
0 references
tardiness
0 references
learning effect
0 references
0 references
0 references
0 references
0 references
0 references
0.8734329342842102
0 references
0.8589158058166504
0 references
0.8586390018463135
0 references
0.8551483154296875
0 references
