A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-008-0098-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980489469 / rank | |||
Normal rank | |||
Revision as of 02:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian approach to single-machine scheduling problems with two competing agents |
scientific article |
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
