A half-product based approximation scheme for agreeably weighted completion time variance

DOI10.1016/J.EJOR.2003.10.045MaRDI QIDQ707130zbMATH OpenOpenAlexFDO

Authors Jinliang Cheng, Wieslaw Kubiak

Publication date 9 February 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.10.045

zbMATH Keywords

Agreeable weightsFully polynomial time approximation schemeHalf-productsSchedulingWeighted completion time variance

Mathematics Subject Classification ID

Approximation algorithms (68W25) Inventory, storage, reservoirs (90B05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Fast fully polynomial approximation schemes for minimizing completion time variance
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Mimimization of agreeably weighted variance in single machine systems
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A lower bound for weighted completion time variance

Cites work

• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• Completion time variance minimization on a single machine is difficult
• Fast fully polynomial approximation schemes for minimizing completion time variance
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• Mimimization of agreeably weighted variance in single machine systems
• Minimization of half-products
• Minimizing Variation of Flow Time in Single Machine Systems
• New results on the completion time variance minimization
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(9)

• 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
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• A polytope for a product of real linear functions in 0/1 variables
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean
• A lower bound for weighted completion time variance

This page was built for publication: A half-product based approximation scheme for agreeably weighted completion time variance

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