Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933)
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: Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem |
scientific article; zbMATH DE number 6369258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem |
scientific article; zbMATH DE number 6369258 |
Statements
Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (English)
0 references
13 November 2014
0 references
scheduling
0 references
availability constraint
0 references
parallel machines
0 references
total weighted completion time
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.85662055
0 references
0.8545294
0 references
0.8448384
0 references
0.8436846
0 references
0.8435362
0 references
0.8391525
0 references
0 references
