A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518)
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: A Lagrangian approach to single-machine scheduling problems with two competing agents |
scientific article; zbMATH DE number 5678457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian approach to single-machine scheduling problems with two competing agents |
scientific article; zbMATH DE number 5678457 |
Statements
A Lagrangian approach to single-machine scheduling problems with two competing agents (English)
0 references
8 March 2010
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
multi-agent scheduling
0 references
single-machine scheduling
0 references
0 references
0 references
0.854185938835144
0 references
0.8528310060501099
0 references
0.8486477136611938
0 references
0.8444777727127075
0 references
