Minimizing mean completion time in a batch processing system

DOI10.1007/S00453-003-1053-2zbMath1095.68009OpenAlexW1972778917MaRDI QIDQ1879250

Haodi Feng, Hong Zhu, Pixing Zhang, Xiaotie Deng, Yu-Zhong 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)

Related Items (11)

On-line scheduling with rejection on identical parallel machines ⋮ No-Wait Scheduling Problems with Batching Machines ⋮ The coordination of transportation and batching scheduling ⋮ Unnamed Item ⋮ A PTAS for semiconductor burn-in scheduling ⋮ Single machine batch scheduling with release times ⋮ An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Scheduling jobs with release dates on parallel batch processing machines ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ On-line scheduling of unit time jobs with rejection on uniform machines

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