On-line scheduling a batch processing system to minimize total weighted job completion time

DOI10.1023/B:JOCO.0000021939.01674.1fzbMath1058.90024OpenAlexW2063824228MaRDI QIDQ1768601

Xiaotie Deng, Wenan Zang, Bo Chen

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000021939.01674.1f

zbMATH Keywords

schedulingperformance guaranteeon-linebatch processing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ Unnamed Item ⋮ A PTAS for semiconductor burn-in scheduling ⋮ Single machine batch scheduling with release times ⋮ Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines

This page was built for publication: On-line scheduling a batch processing system to minimize total weighted job completion time