A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-006-9001-0 / rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Problems with Two Competing Agents / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel machine scheduling with high multiplicity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124332 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-006-9001-0 / rank | |||
Normal rank | |||
Latest revision as of 08:07, 18 December 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
