STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS
There is a conjecture that for any dense schedule in the problem Om||Cmax the makespan is atmost (2− 1/m) times the makespan of the optimal schedule, where “m” is the number of machines. In the paper the conjecture is proved for m ≤ 9 аnd some other special cases.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!