A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
type: Item
instance of: scholarly article
title: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
zbMATH Open document ID: 1229.90067
author: Juan-Miguel Gracia
published in: Journal of Scheduling
publication date: 2012-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5997876
zbMATH Keywords: parallel-batch scheduling
zbMATH Keywords: online algorithm
zbMATH Keywords: restart
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10951-010-0172-2
OpenAlex ID: W2062953948
cites work: Scheduling a batching machine
cites work: Approximation algorithms in batch processing
cites work: Lower bounds for on-line single-machine scheduling.
cites work: Online scheduling in a parallel batch processing system to minimize makespan using restarts
cites work: On-line scheduling on a batch machine to minimize makespan with limited restarts
cites work: On-line scheduling on a single machine: Maximizing the number of early jobs
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: On-line scheduling algorithms for a batch machine with finite capacity
cites work: Minimizing the total completion time on-line on a single machine, using restarts
cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1007/S10951-010-0172-2
description: scientific article; zbMATH DE number 5997876