Online scheduling on bounded batch machines to minimize the maximum weighted completion time
type: Item
instance of: scholarly article
title: Online scheduling on bounded batch machines to minimize the maximum weighted completion time
zbMATH Open document ID: 1413.90095
author: Wenhua Li
author: Xing Chai
published in: Journal of the Operations Research Society of China
publication date: 2018-08-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6915973
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: maximum weighted completion time
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s40305-017-0179-x
OpenAlex ID: W2766772614
cites work: Scheduling a batching machine
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: On-line algorithms for minimizing makespan on batch processing machines
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
cites work: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
cites work: Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Scheduling one batch processor subject to job release dates
cites work: Online scheduling on unbounded parallel-batch machines to minimize the makespan
cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: Two-agent scheduling to minimize the total cost
cites work: Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
DOI: 10.1007/S40305-017-0179-X
description: scientific article; zbMATH DE number 6915973