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:ira.lib.polyu.edu.hk:10397/672

Parallel-machine scheduling with simple linear deterioration to minimize total completion time

Authors
Publication date
16 July 2008
Publisher
'Elsevier BV'
Doi

    Abstract

    We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years.Department of Logistics and Maritime Studie

    Similar works

    Full text

    thumbnail-image

    The Hong Kong Polytechnic University Pao Yue-kong Library

    redirect
    oaioai:ira.lib.polyu.edu.hk:10397...
    Last time updated on 10/02/2018

    This paper was published in The Hong Kong Polytechnic University Pao Yue-kong Library.

    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.