Minimizing sum of completion times on a single machine with sequence-dependent family setup times (Q5469663)
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 5026983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing sum of completion times on a single machine with sequence-dependent family setup times |
scientific article; zbMATH DE number 5026983 |
Statements
Minimizing sum of completion times on a single machine with sequence-dependent family setup times (English)
0 references
26 May 2006
0 references
single machine scheduling
0 references
sum of completion times
0 references
family setups
0 references
branch-and-bound
0 references
Lagrangean relaxation
0 references
0.8568122982978821
0 references
0.8446562886238098
0 references
0.8354625105857849
0 references
0.8204090595245361
0 references
