Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/11073
Title: Scheduling of two parallel machines with linear decreasing time slot costs to minimize total weightedcompletion time
Authors: Lushchakova, I. N.
Kononov, V. A.
Keywords: публикации ученых
scheduling
parallel machines
time slot costs
total weighted completion time
dynamic programming
Issue Date: 2016
Publisher: Far Eastern Federal University
Citation: Kononov, V. A. Scheduling of two parallel machines with linear decreasing time slot costs to minimize total weightedcompletion time / V. A. Kononov, I. N. Lushchakova // International Conference on Discrete Optimization and Operations Research (DOOR 2016), (Vladivostok, Russia, September 19-23, 2016 г.) . - Vladivostok, 2016. - Vol.1623. - P. 344-349.
Abstract: We consider a scheduling problem with two parallel machines to minimize the sum of total weighted completion time and total machine time slot cost. In this paper we focus on the case of the constant or linear decreasing sequences of time slot costs. We suggest an exact pseudopolynomial DP algorithm for the case of arbitrary integer processing times of jobs. If all jobs have unit processing times, we modify our approach to obtain a polynomial algorithm.
URI: https://libeldoc.bsuir.by/handle/123456789/11073
Appears in Collections:Публикации в изданиях других стран

Files in This Item:
File Description SizeFormat 
Scheduling.pdf278,33 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.