Some Generalisations of the Time Minimising Assignment Problem (Q3914763): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/2581536 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4253546699 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:00, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some Generalisations of the Time Minimising Assignment Problem |
scientific article |
Statements
Some Generalisations of the Time Minimising Assignment Problem (English)
0 references
1981
0 references
time minimising assignment
0 references
algorithms
0 references
minimization of total completion time
0 references
bottleneck assignment
0 references
individual job start
0 references