A PTAS for minimizing total completion time of bounded batch scheduling

DOI10.1007/3-540-47867-1_22MaRDI QIDQ4737535zbMATH OpenFDO

Authors Haodi Feng, Guojun Li, Mao-Cheng Cai, Xiaotie Deng, Guizhen Liu

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370304.htm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling
• scientific article; zbMATH DE number 5059917
• A PTAS for the P-batch scheduling with \(p_j=p\) to minimize total weighted completion time
• Minimizing mean completion time in a batch processing system

Cited in

(8)

• A PTAS for semiconductor burn-in scheduling
• A PTAS for the P-batch scheduling with \(p_j=p\) to minimize total weighted completion time
• Designing PTASs for MIN-SUM scheduling problems
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling
• scientific article; zbMATH DE number 5059917 (Why is no real title available?)
• The coordination of transportation and batching scheduling

This page was built for publication: A PTAS for minimizing total completion time of bounded batch scheduling

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