FPTAS for half-products minimization with scheduling applications
type: Item
instance of: scholarly article
title: FPTAS for half-products minimization with scheduling applications
zbMATH Open document ID: 1155.90379
author: Erdal Erel
author: Jay B. Ghosh
published in: Discrete Applied Mathematics
publication date: 2009-03-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5526354
zbMATH Keywords: quadratic pseudo-Boolean functions
zbMATH Keywords: dynamic programming
zbMATH Keywords: approximation scheme
MaRDI profile type: Publication
full work available at URL: j.dam.2008.01.018
OpenAlex ID: W2140465779
cites work: Minimization of half-products
cites work: A half-product based approximation scheme for agreeably weighted completion time variance
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Positive half-products and scheduling with controllable processing times
cites work: Algorithms for minclique scheduling problems
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
cites work: New results on the completion time variance minimization
cites work: Minimization of ordered, symmetric half-products
cites work: Fast fully polynomial approximation schemes for minimizing completion time variance
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Algorithms for Scheduling Independent Tasks
cites work: Single machine scheduling with controllable release and processing parameters
cites work: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
DOI: 10.1016/J.DAM.2008.01.018
description: scientific article; zbMATH DE number 5526354