License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.19
URN: urn:nbn:de:0030-drops-82335
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8233/
Go to the corresponding LIPIcs Volume Portal

Calinescu, Gruia ; Jaehn, Florian ; Li, Minming ; Wang, Kai

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

pdf-format:
LIPIcs-ISAAC-2017-19.pdf (0.5 MB)

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).

BibTeX - Entry

@InProceedings{calinescu_et_al:LIPIcs:2017:8233,
  author =	{Gruia Calinescu and Florian Jaehn and Minming Li and Kai Wang},
  title =	{{An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint}},
  booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
  pages =	{19:1--19:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-054-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{92},
  editor =	{Yoshio Okamoto and Takeshi Tokuyama},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8233},
  URN =		{urn:nbn:de:0030-drops-82335},
  doi =		{10.4230/LIPIcs.ISAAC.2017.19},
  annote =	{Keywords: FPTAS, Scheduling, Approximation Algorithm}
}

Keywords: FPTAS, Scheduling, Approximation Algorithm
Collection: 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Issue Date: 2017
Date of publication: 07.12.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI