Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
type: Item
instance of: scholarly article
title: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
zbMATH Open document ID: 1310.90046
author: Jinjiang Yuan
author: Wenjie Li
published in: Optimization Letters
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6377197
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: preemption-restart
zbMATH Keywords: incompatible families
MaRDI profile type: Publication
full work available at URL: s11590-013-0650-5
OpenAlex ID: W2040397633
cites work: Computing and Combinatorics
cites work: Online interval scheduling: Randomized and multiprocessor cases
cites work: Improved on-line broadcast scheduling with deadlines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Design and analysis of online batching systems
cites work: Algorithms - ESA 2003
cites work: Scheduling broadcasts with deadlines
cites work: Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
cites work: Scheduling with batching: A review
cites work: On-line scheduling of jobs with fixed start and end times
DOI: 10.1007/S11590-013-0650-5
description: scientific article; zbMATH DE number 6377197