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

DOI10.1287/IJOC.11.2.211MaRDI QIDQ4427378zbMATH OpenOpenAlexFDO

Authors 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

fully polynomial time approximation schemejob completion timesscheduling

Mathematics Subject Classification ID

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

Cited in

(11)

• FPTAS for half-products minimization with scheduling applications
• Fast fully polynomial approximation schemes for minimizing completion time variance
• The single machine weighted mean squared deviation problem
• Minimization of ordered, symmetric half-products
• 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
• 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
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• A half-product based approximation scheme for agreeably weighted completion time variance
• Scheduling jobs on a single machine to maximize the total revenue of jobs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427378)