Minimizing mean completion time in a batch processing system

DOI10.1007/S00453-003-1053-2MaRDI QIDQ1879250zbMATH OpenOpenAlexFDO

Authors Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu, Yuzhong Zhang

Publication date 22 September 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1053-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Batch-processing scheduling with setup times
• Minimizing makespan in batch machine scheduling
• scientific article; zbMATH DE number 2080976
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• scientific article; zbMATH DE number 2081006

Cited in

(16)

• On-line scheduling a batch processing system to minimize total weighted job completion time
• A PTAS for semiconductor burn-in scheduling
• On-line scheduling of unit time jobs with rejection on uniform machines
• Batch-processing scheduling with setup times
• Minimizing total completion time on a batching machine with job processing time compatibilities
• Scheduling an unbounded batching machine with job processing time compatibilities
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• scientific article; zbMATH DE number 2086930 (Why is no real title available?)
• Unbounded parallel-batch scheduling with drop-line tasks
• The coordination of transportation and batching scheduling
• On-line scheduling with rejection on identical parallel machines
• No-wait scheduling problems with batching machines
• Single machine batch scheduling with release times
• An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
• scientific article; zbMATH DE number 1559487 (Why is no real title available?)
• Scheduling jobs with release dates on parallel batch processing machines

This page was built for publication: Minimizing mean completion time in a batch processing system

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