Minimizing total weighted completion time on parallel unbounded batch machines

MaRDI QIDQ3442682zbMATH OpenFDO

Authors Shu-Guang Li, Guojun Li, Xiuhong Wang

Publication date 22 May 2007

zbMATH Keywords

polynomial time approximation schemerelease times

Mathematics Subject Classification ID

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

Recommendations

• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• scientific article; zbMATH DE number 5059917
• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
• scientific article; zbMATH DE number 2080976
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

Cited in

(15)

• Scheduling fully parallel jobs
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• Serial-batching scheduling problem to minimize total weighted completion time
• Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
• scientific article; zbMATH DE number 2080976 (Why is no real title available?)
• Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

This page was built for publication: Minimizing total weighted completion time on parallel unbounded batch machines

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