Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-005-6814-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994580849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4437507 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bin packing with divisible item sizes / 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: On Scheduling Independent Tasks with Restricted Execution Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / rank | |||
Normal rank | |||
Latest revision as of 18:08, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems |
scientific article |
Statements
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (English)
0 references
15 May 2007
0 references
multiprocessor scheduling
0 references
polynomial algorithms
0 references
high-multiplicity
0 references
