A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6562249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times |
scientific article; zbMATH DE number 6562249 |
Statements
A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (English)
0 references
1 April 2016
0 references
maximum tardiness problem
0 references
learning effect
0 references
deterioration effects
0 references
setup times
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8809210658073425
0 references
0.8621804714202881
0 references
0.8321221470832825
0 references
0.8302023410797119
0 references
