scientific article; zbMATH DE number 5059917

MaRDI QIDQ5490470zbMATH OpenFDO

Authors Shu-Guang Li, Guojun Li, Hongluan Zhao

Publication date 4 October 2006

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2086930
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• Minimizing total completion time of batch scheduling with nonidentical job sizes
• Batch scheduling to minimize total completion time
• scientific article; zbMATH DE number 2080976
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• Minimizing completion time for a class of scheduling problems
• Minimizing the maximum flow time in batch scheduling
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan

Cited in

(13)

• Minimizing the maximum flow time in batch scheduling
• Minimizing makespan with release times on identical parallel batching machines
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Minimizing total completion time on a batching machine with job processing time compatibilities
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• Minimizing total weighted completion time on parallel unbounded batch machines
• Batch scheduling with deteriorating jobs to minimize the total completion time
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• scientific article; zbMATH DE number 2080976 (Why is no real title available?)
• The bounded parallel-batching scheduling with drop-line jobs to minimize total completion time
• scientific article; zbMATH DE number 2086930 (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 Q5490470)