Approximation algorithm for minimizing total latency in machine scheduling with deliveries

DOI10.1016/J.DISOPT.2007.11.007zbMath1134.90018OpenAlexW2040782619MaRDI QIDQ924636

Michal Penn, Asaf Levin

Publication date: 16 May 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.11.007

zbMATH Keywords

schedulingapproximation algorithmminimum latency

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

On the max coloring problem ⋮ SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

Cites Work

• Unnamed Item
• Strongly polynomial-time approximation for a class of bicriteria problems.
• Machine scheduling with deliveries to multiple customer locations
• An improved approximation ratio for the minimum latency problem
• Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Saving an epsilon
• Combinatorial Optimization with Rational Objective Functions
• P-Complete Approximation Problems
• A General Approximation Technique for Constrained Forest Problems

This page was built for publication: Approximation algorithm for minimizing total latency in machine scheduling with deliveries