A best possible on-line algorithm for scheduling on uniform parallel-batch machines
type: Item
instance of: scholarly article
title: A best possible on-line algorithm for scheduling on uniform parallel-batch machines
zbMATH Open document ID: 1395.90149
author: Wenhua Li
author: Xing Chai
author: Yali Song
published in: Theoretical Computer Science
publication date: 2018-06-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6882316
zbMATH Keywords: online algorithm
zbMATH Keywords: uniform machines
zbMATH Keywords: parallel-batch machines
zbMATH Keywords: makespan
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.05.014
OpenAlex ID: W2804966092
cites work: Scheduling a batching machine
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
cites work: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
cites work: An optimal online algorithm for scheduling two machines with release times
cites work: Online scheduling on unbounded parallel-batch machines to minimize the makespan
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: A best online algorithm for scheduling on two parallel batch machines
cites work: Best semi-online algorithms for unbounded parallel batch scheduling
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1016/J.TCS.2018.05.014
description: scientific article; zbMATH DE number 6882316