Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (Q1949673): 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.1016/j.orl.2012.12.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046770574 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine |
scientific article |
Statements
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (English)
0 references
14 May 2013
0 references
scheduling
0 references
algorithms
0 references
online
0 references
approximation
0 references
primal-dual
0 references
dual fitting
0 references
