Citation

Kvaratskhelia, A and Lazarev, A Polynomial algorithm for 1 r_j , p_j = p, pmnt SUM(w_i c_j) scheduling problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 68-76, 2009.

Paper


Abstract

In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. Before this paper the problem is known to be open. Here, we present a polynomial time algorithm that solves the problem with O(n^7) operations.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{2009-068-076-P, author = {A. Kvaratskhelia and A. Lazarev},
title = {Polynomial algorithm for 1 r_j , p_j = p, pmnt SUM(w_i c_j) scheduling problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {68--76},
note = {Paper},
abstract = {In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. Before this paper the problem is known to be open. Here, we present a polynomial time algorithm that solves the problem with O(n^7) operations.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-068-076-P.pdf} }