A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467): 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/s10878-006-9001-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049449905 / rank | |||
Normal rank | |||
Revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of the problem of two-agent scheduling on a single machine |
scientific article |
Statements
A note on the complexity of the problem of two-agent scheduling on a single machine (English)
0 references
12 October 2007
0 references
Production/scheduling
0 references
Multi-agent deterministic sequencing
0 references
Games/group decisions
0 references
Cooperative sequencing
0 references
