A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Designing PTASs for MIN-SUM scheduling problems
- A PTAS for semiconductor burn-in scheduling
- scientific article; zbMATH DE number 2080976 (Why is no real title available?)
- Model approximation for batch flow shop scheduling with fixed batch sizes
- 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
- Mixed batch scheduling on identical machines
- Batch scheduling of nonidentical job sizes with minsum criteria
- scientific article; zbMATH DE number 2086930 (Why is no real title available?)
- scientific article; zbMATH DE number 5059917 (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 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 Q3021988)