IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v193y2009i2p637-638.html
   My bibliography  Save this article

A faster fully polynomial approximation scheme for the single-machine total tardiness problem

Author

Listed:
  • Koulamas, Christos

Abstract

Lawler [E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207-208] proposed a fully polynomial approximation scheme for the single-machine total tardiness problem which runs in time (where n is the number of jobs and [epsilon] is the desired level of approximation). A faster fully polynomial approximation scheme running in time is presented in this note by applying an alternative rounding scheme in conjunction with implementing Kovalyov's [M.Y. Kovalyov, Improving the complexities of approximation algorithms for optimization problems, Operations Research Letters 17 (1995) 85-87] bound improvement procedure.

Suggested Citation

  • Koulamas, Christos, 2009. "A faster fully polynomial approximation scheme for the single-machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 637-638, March.
  • Handle: RePEc:eee:ejores:v:193:y:2009:i:2:p:637-638
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00006-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Szwarc, Wlodzimierz, 2007. "Some remarks on the decomposition properties of the single machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 177(1), pages 623-625, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    2. Xu, Zhou, 2012. "A strongly polynomial FPTAS for the symmetric quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 377-381.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:193:y:2009:i:2:p:637-638. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.