Parallel-machine batch scheduling with non-identical job sizes

MaRDI QIDQ5453051zbMATH OpenFDO

Authors Zhenguang Yang, Shu-Guang Li, Xiuhong Wang

Publication date 4 April 2008

zbMATH Keywords

approximation algorithmsbatch processingmakespanscheduling theory

Mathematics Subject Classification ID

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

Recommendations

• Scheduling parallel batch processing machines with non-identical job sizes
• An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Batch scheduling of nonidentical job sizes with minsum criteria
• Approximation schemes for scheduling a batching machine with nonidentical job size

Cited in

(16)

• An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
• Minimizing total completion time of batch scheduling with nonidentical job sizes
• Batch scheduling of nonidentical job sizes with minsum criteria
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Approximation schemes for scheduling a batching machine with nonidentical job size
• Duplicating in batch scheduling
• Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
• An algorithm for on-line batch scheduling with nonidentical job sizes
• An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Scheduling parallel batch processing machines with non-identical job sizes
• An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan
• Improved bounds for batch scheduling with nonidentical job sizes
• Two-customer parallel batch processing machines with non-identical job sizes
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes

This page was built for publication: Parallel-machine batch scheduling with non-identical job sizes

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