An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine

DOI10.1287/ijoc.11.2.211zbMath1040.90527OpenAlexW2028663810MaRDI QIDQ4427378

Gerhard J. Woeginger

Publication date: 1999

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.11.2.211

zbMATH Keywords

schedulingjob completion timesfully polynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (11)

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ The single machine weighted mean squared deviation problem ⋮ Minimization of ordered, symmetric half-products ⋮ A half-product based approximation scheme for agreeably weighted completion time variance ⋮ FPTAS for half-products minimization with scheduling applications ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Fast fully polynomial approximation schemes for minimizing completion time variance

This page was built for publication: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine