SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS
We consider a scheduling problem with two parallel machines to minimize the sum of total weighted completion time and total machine time slot costs. In the case of the constant or linear decreasing sequences of time slotcosts we suggest an exact pseudopolynomial DP algorithm.
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/72 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849336252296331264 |
|---|---|
| author | A. V. Kononov I. N. Lushchakova |
| author_facet | A. V. Kononov I. N. Lushchakova |
| author_sort | A. V. Kononov |
| collection | DOAJ |
| description | We consider a scheduling problem with two parallel machines to minimize the sum of total weighted completion time and total machine time slot costs. In the case of the constant or linear decreasing sequences of time slotcosts we suggest an exact pseudopolynomial DP algorithm. |
| format | Article |
| id | doaj-art-1e204017d98c4a688fb76d4cc77acd89 |
| institution | Kabale University |
| issn | 1816-0301 |
| language | Russian |
| publishDate | 2016-09-01 |
| publisher | National Academy of Sciences of Belarus, the United Institute of Informatics Problems |
| record_format | Article |
| series | Informatika |
| spelling | doaj-art-1e204017d98c4a688fb76d4cc77acd892025-08-20T03:45:02ZrusNational Academy of Sciences of Belarus, the United Institute of Informatics ProblemsInformatika1816-03012016-09-0103808671SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTSA. V. Kononov0I. N. Lushchakova1Институт математики им. С. Л. Соболева СО РАНБелорусский государственный университет информатики и радиоэлектроникиWe consider a scheduling problem with two parallel machines to minimize the sum of total weighted completion time and total machine time slot costs. In the case of the constant or linear decreasing sequences of time slotcosts we suggest an exact pseudopolynomial DP algorithm.https://inf.grid.by/jour/article/view/72 |
| spellingShingle | A. V. Kononov I. N. Lushchakova SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS Informatika |
| title | SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS |
| title_full | SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS |
| title_fullStr | SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS |
| title_full_unstemmed | SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS |
| title_short | SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS |
| title_sort | scheduling jobs on two parallel machines with linear decreasing time slot costs |
| url | https://inf.grid.by/jour/article/view/72 |
| work_keys_str_mv | AT avkononov schedulingjobsontwoparallelmachineswithlineardecreasingtimeslotcosts AT inlushchakova schedulingjobsontwoparallelmachineswithlineardecreasingtimeslotcosts |