The 2-valued case of makespan minimization with assignment constraints (Q1941692): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073449782 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1212.1609 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:50, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-valued case of makespan minimization with assignment constraints |
scientific article |
Statements
The 2-valued case of makespan minimization with assignment constraints (English)
0 references
21 March 2013
0 references
approximation algorithms
0 references
scheduling
0 references
makespan minimization
0 references
graph balancing
0 references
