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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/8 |
| _version_ | 1797877395591528448 |
|---|---|
| author | G. P. Volchkova V. M. Kotov |
| author_facet | G. P. Volchkova V. M. Kotov |
| author_sort | G. P. Volchkova |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-10T02:17:38Z |
| format | Article |
| id | doaj.art-a524d98d5e3e4fbc9ddd8c6a5ef19606 |
| institution | Directory Open Access Journal |
| issn | 1816-0301 |
| language | Russian |
| last_indexed | 2024-04-10T02:17:38Z |
| publishDate | 2016-09-01 |
| publisher | The United Institute of Informatics Problems of the National Academy of Sciences of Belarus |
| record_format | Article |
| series | Informatika |
| spelling | doaj.art-a524d98d5e3e4fbc9ddd8c6a5ef196062023-03-13T08:32:16ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of BelarusInformatika1816-03012016-09-010164727STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITSG. P. Volchkova0V. M. Kotov1Белорусский государственный университетБелорусский государственный университет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.https://inf.grid.by/jour/article/view/8 |
| spellingShingle | G. P. Volchkova V. M. Kotov STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS Informatika |
| title | STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS |
| title_full | STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS |
| title_fullStr | STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS |
| title_full_unstemmed | STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS |
| title_short | STUDYING PROPERTIES OF DENSE SCHEDULES UNDER CONDITION OF LIMITED NUMBER OF SERVICE UNITS |
| title_sort | studying properties of dense schedules under condition of limited number of service units |
| url | https://inf.grid.by/jour/article/view/8 |
| work_keys_str_mv | AT gpvolchkova studyingpropertiesofdenseschedulesunderconditionoflimitednumberofserviceunits AT vmkotov studyingpropertiesofdenseschedulesunderconditionoflimitednumberofserviceunits |