Minimization of Half-Products
From MaRDI portal
Publication:2757557
DOI10.1287/moor.23.3.649zbMath0977.90026WikidataQ59560822 ScholiaQ59560822MaRDI QIDQ2757557
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e117da3d6abb2ca86bfe75830e381d14915a7cef
fully polynomial approximation scheme; completion time variance minimization; quadratic binary minimization
Related Items
Pseudo-Boolean optimization, A half-product based approximation scheme for agreeably weighted completion time variance, Good neighbors are hard to find: Computational complexity of network formation, FPTAS for half-products minimization with scheduling applications, Minimization of ordered, symmetric half-products, Positive half-products and scheduling with controllable processing times, Optimal testing and repairing a failed series system, A survey of scheduling with controllable processing times, Single machine scheduling with controllable release and processing parameters