scientific article; zbMATH DE number 1559487

MaRDI QIDQ4526946zbMATH OpenFDO

Authors Jihuan Ding, Lili Liu, Baoshan Jiang, Yuzhong Zhang

Publication date 13 September 2001

zbMATH Keywords

batch processingdynamic programmingNP-completeperformance ratio

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Study for batch scheduling on single machine
• scientific article; zbMATH DE number 6129431
• Minimizing mean completion time in a batch processing system
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• Batch-processing scheduling with setup times

Cited in

(10)

• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• Approximation algorithms in batch processing
• Approximation for batching via priorities
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• An algorithm of minimizing the total weighted completed time on batch processing machine
• The proof on the NP-completeness of two batching scheduling problems
• Study for batch scheduling on single machine
• scientific article; zbMATH DE number 6129431 (Why is no real title available?)
• scientific article; zbMATH DE number 1420452 (Why is no real title available?)
• scientific article; zbMATH DE number 2190176 (Why is no real title available?)

This page was built for publication:

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