Minimization of ordered, symmetric half-products

Authors:
Wieslaw Kubiak
Affiliations:
Faculty of Business Administration, Memorial University of Newfoundland, St. John's, NL, Canada A1B 3X5
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 16
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
Integer and combinatorial optimization

Integer and combinatorial optimization
Modeling brain function—the world of attractor neural networks

Modeling brain function—the world of attractor neural networks
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
New results on the completion time variance minimization

Proceedings of the workshop on Discrete algorithms
Algorithms for minclique scheduling problems

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Minimization of Half-Products

Mathematics of Operations Research
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine

INFORMS Journal on Computing
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
Fast approximation algorithms for knapsack problems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Completion time variance minimization on a single machine is difficult

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

We introduce a class of pseudo-Boolean functions called ordered, symmetric half-products. The class includes a number of well known scheduling problems. We study sets of dominating solutions for minimization of the half-products, and we show their fully polynomial time approximation schemes that use a natural rounding scheme to obtain @e-solutions in O(n^2/@e) time.