Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
type: Item
instance of: scholarly article
title: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
zbMATH Open document ID: 1229.90057
author: Juan-Miguel Gracia
published in: Information Processing Letters
publication date: 2012-01-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5999005
zbMATH Keywords: online scheduling
zbMATH Keywords: parallel-batching machines
zbMATH Keywords: limited restart
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.04.008
OpenAlex ID: W2041764641
cites work: Scheduling a batching machine
cites work: Scheduling on identical machines: How good is LPT in an on-line setting?
cites work: Approximation algorithms in batch processing
cites work: On-line scheduling on a batch machine to minimize makespan with limited restarts
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: An optimal online algorithm for scheduling two machines with release times
cites work: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
cites work: Minimizing makespan in batch machine scheduling
cites work: Online scheduling on unbounded parallel-batch machines to minimize the makespan
cites work: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1016/J.IPL.2010.04.008
description: scientific article; zbMATH DE number 5999005