Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine

DOI10.1007/978-3-642-02026-1_38zbMath1246.90062OpenAlexW1506739179MaRDI QIDQ3637087

Xianzhao Zhang, Guo Sun, Jianfeng Ren, Yu-Zhong Zhang

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_38

zbMATH Keywords

dynamic programmingapproximation algorithmsunbounded batch machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

A survey of single machine scheduling to minimize weighted number of tardy jobs

This page was built for publication: Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine