Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:23, 7 February 2024
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
