FPTAS for half-products minimization with scheduling applications
From MaRDI portal
Publication:1005250
DOI10.1016/J.DAM.2008.01.018zbMATH Open1155.90379OpenAlexW2140465779MaRDI QIDQ1005250FDOQ1005250
Authors: Erdal Erel, Jay B. Ghosh 
Publication date: 9 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.018
Recommendations
- Minimization of ordered, symmetric half-products
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Differential approximation schemes for half-product related functions and their scheduling applications
- Minimization of half-products
Cites Work
- Minimization of ordered, symmetric half-products
- Positive half-products and scheduling with controllable processing times
- New results on the completion time variance minimization
- Single machine scheduling with controllable release and processing parameters
- Minimization of half-products
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for minclique scheduling problems
- Fast approximation algorithm for job sequencing with deadlines
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Improving the complexities of approximation algorithms for optimization problems
- Fast fully polynomial approximation schemes for minimizing completion time variance
- A half-product based approximation scheme for agreeably weighted completion time variance
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
Cited In (19)
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean
- Title not available (Why is that?)
- Designing PTASs for MIN-SUM scheduling problems
- Minimization of ordered, symmetric half-products
- Differential approximation schemes for half-product related functions and their scheduling applications
- Approximability issues for unconstrained and constrained maximization of half-product related functions
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Minimization of half-products
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Single machine scheduling with a generalized job-dependent cumulative effect
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- An FPTAS for a supply scheduling problem with non-monotone cost functions
This page was built for publication: FPTAS for half-products minimization with scheduling applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005250)
