Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
type: Item
instance of: scholarly article
title: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
zbMATH Open document ID: 1260.68474
author: Wenhua Li
author: Jinjiang Yuan
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6150461
zbMATH Keywords: online algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: parallel-batch machines
zbMATH Keywords: maximum flow-time
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.008
OpenAlex ID: W2073731934
cites work: Control of a batch-processing machine: A computational approach
cites work: Scheduling a batching machine
cites work: Approximation algorithms in batch processing
cites work: Q3995531
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
cites work: Scheduling one batch processor subject to job release dates
cites work: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity
cites work: On-line scheduling algorithms for a batch machine with finite capacity
cites work: Minimizing makespan in batch machine scheduling
cites work: A best online algorithm for scheduling on two parallel batch machines
cites work: Online scheduling on unbounded parallel-batch machines to minimize the makespan
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1016/J.IPL.2011.06.008
description: scientific article; zbMATH DE number 6150461