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

DOI10.1007/978-3-642-02026-1_38MaRDI QIDQ3637087zbMATH OpenOpenAlexFDO

Authors Jianfeng Ren, Xianzhao Zhang, Guo Sun, Yuzhong 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

approximation algorithmsdynamic programmingunbounded batch machine

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Minimizing total weighted completion time on parallel unbounded batch machines
• Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
• scientific article; zbMATH DE number 866105
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

Cited in

(7)

• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• scientific article; zbMATH DE number 866105 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637087)