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

DOI10.1016/j.ejor.2003.10.045zbMath1132.90322OpenAlexW2081872308MaRDI QIDQ707130

Jinliang Cheng, Wiesław X. 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

SchedulingAgreeable weightsFully polynomial time approximation schemeHalf-productsWeighted completion time variance

Mathematics Subject Classification ID

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

Related Items

A Polytope for a Product of Real Linear Functions in 0/1 Variables, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A lower bound for weighted completion time variance, The symmetric quadratic knapsack problem: approximation and scheduling applications, The single machine weighted mean squared deviation problem, Minimization of ordered, symmetric half-products, Minimizing weighted mean absolute deviation of job completion times from their weighted mean, FPTAS for half-products minimization with scheduling applications

Cites Work

• Unnamed Item
• Mimimization of agreeably weighted variance in single machine systems
• Completion time variance minimization on a single machine is difficult
• Fast fully polynomial approximation schemes for minimizing completion time variance
• New results on the completion time variance minimization
• Minimization of Half-Products
• Minimizing Variation of Flow Time in Single Machine Systems
• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• Variance Minimization in Single Machine Sequencing Problems