Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs |
scientific article; zbMATH DE number 6377197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs |
scientific article; zbMATH DE number 6377197 |
Statements
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (English)
0 references
5 December 2014
0 references
scheduling
0 references
online algorithms
0 references
preemption-restart
0 references
incompatible families
0 references
0.971518576145172
0 references
0.8932052254676819
0 references
0.8706457614898682
0 references
