Fast fully polynomial approximation schemes for minimizing completion time variance |
| |
| Institution: | 1. Institute of Radiation Protection and Nuclear Safety (IRSN)/PRP-DGE/SRTG/LETIS, BP 17, 92262 Fontenay aux Roses, France;2. HeidelbergCement Technology Center GmbH, 69181 Leimen, Germany;3. Empa, Laboratory for Concrete & Construction Chemistry, 8600 Duebendorf, Switzerland |
| |
| Abstract: | We present fully polynomial approximation schemes (FPASs) for the problem of minimizing completion time variance (CTV) of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n2/ε) and thus improves on all fully polynomial approximation schemes presented in the literature. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
