Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:drops-oai.dagstuhl.de:8233

An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint

Authors
Publication date
1 January 2017
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Doi

    Abstract

    In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS)

    Similar works

    Full text

    thumbnail-image

    Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:8233
    Last time updated on 17/12/2017

    This paper was published in Dagstuhl Research Online Publication Server.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.