A boundle of on-line algorithms for scheduling computational tasks
We deal with the problem of scheduling the set of computational tasks on parallel identical processors. Each task needs a predefined number of processors to perform. The problem is known in scheduling theory and has been considered up to now by a few authors. Starting from the formal original descri...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2025-06-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/135250/8_5023_L_Dorota_sk.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|