Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721)
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: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine |
scientific article; zbMATH DE number 1997783
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine |
scientific article; zbMATH DE number 1997783 |
Statements
Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (English)
0 references
29 October 2003
0 references
single machine scheduling
0 references
master sequence
0 references
mixed-integer linear programming
0 references
Lagrangian relaxation algorithm
0 references
0 references
0 references
0 references
0.9135901
0 references
0.90999955
0 references
0.89993334
0 references
0 references
0.8964875
0 references
0.8957636
0 references
0.8954114
0 references
