A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:46, 2 February 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
