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

DOI10.1023/B:JOCO.0000021939.01674.1fzbMath1058.90024MaRDI 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

scheduling; performance guarantee; on-line; batch processing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

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, Single machine batch scheduling with release times, Scheduling an unbounded batching machine with job processing time compatibilities, A PTAS for semiconductor burn-in scheduling, Online algorithms to schedule a proportionate flexible flow shop of batching machines, Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan, Unnamed Item, Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times, MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES