SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS

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.

Bibliographic Details
Main Authors: A. V. Kononov, I. N. Lushchakova
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/72
id doaj-1e204017d98c4a688fb76d4cc77acd89
record_format Article
spelling doaj-1e204017d98c4a688fb76d4cc77acd892021-07-28T21:07:21ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of Belarus Informatika1816-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
collection DOAJ
language Russian
format Article
sources DOAJ
author A. V. Kononov
I. N. Lushchakova
spellingShingle A. V. Kononov
I. N. Lushchakova
SCHEDULING JOBS ON TWO PARALLEL MACHINES WITH LINEAR DECREASING TIME SLOT COSTS
Informatika
author_facet A. V. Kononov
I. N. Lushchakova
author_sort A. V. Kononov
title 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_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_sort scheduling jobs on two parallel machines with linear decreasing time slot costs
publisher The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
series Informatika
issn 1816-0301
publishDate 2016-09-01
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.
url https://inf.grid.by/jour/article/view/72
work_keys_str_mv AT avkononov schedulingjobsontwoparallelmachineswithlineardecreasingtimeslotcosts
AT inlushchakova schedulingjobsontwoparallelmachineswithlineardecreasingtimeslotcosts
_version_ 1721262955786403840

Similar Items