A PTAS for the P-batch scheduling with p_j=p to minimize total weighted completion time

DOI10.3934/JIMO.2005.1.353MaRDI QIDQ2386615zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Weiping Shang

Publication date 1 September 2005

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/jimo.2005.1.353

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• The PTAS for the problem of \(P_m|r_j,B|\sum C_j\)
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• scientific article; zbMATH DE number 2086930
• A PTAS for minimizing the total weighted completion time on identical parallel machines.

Cited in

(8)

• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• Designing PTASs for MIN-SUM scheduling problems
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Algorithmic Applications in Management
• The PTAS for the problem of \(P_m|r_j,B|\sum C_j\)
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• scientific article; zbMATH DE number 2086930 (Why is no real title available?)
• scientific article; zbMATH DE number 1839475 (Why is no real title available?)

This page was built for publication: A PTAS for the P-batch scheduling with \(p_j=p\) to minimize total weighted completion time

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