@inproceedings{39a5078927f94e90b59998b0dec9abeb,
title = "An FPTAS of minimizing total weighted completion time on single machine with position constraint",
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).",
keywords = "Approximation Algorithm, FPTAS, Scheduling",
author = "Gruia Cǎlinescu and Florian Jaehn and Minming Li and Kai Wang",
year = "2017",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2017.19",
language = "英语",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Takeshi Tokuyama and Yoshio Okamoto",
booktitle = "28th International Symposium on Algorithms and Computation, ISAAC 2017",
note = "28th International Symposium on Algorithms and Computation, ISAAC 2017 ; Conference date: 09-12-2017 Through 22-12-2017",
}