An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
type: Item
instance of: scholarly article
title: An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
zbMATH Open document ID: 1383.90012
author: Ruyan Fu
author: Ji Tian
author: Jinjiang Yuan
author: Shisheng Li
published in: Journal of Combinatorial Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6804423
zbMATH Keywords: online scheduling
zbMATH Keywords: batch machine
zbMATH Keywords: compatibility
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10878-017-0139-8
OpenAlex ID: W2615369083
cites work: Scheduling an unbounded batching machine with job processing time compatibilities
cites work: Q5431779
cites work: Scheduling a batch processing machine with bipartite compatibility graphs
cites work: Scheduling a batching machine
cites work: Approximation algorithms in batch processing
cites work: The Batch Loading and Scheduling Problem
cites work: Batch processing with interval graph compatibilities between tasks
cites work: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
cites work: Minimizing number of tardy jobs on a batch processing machine with incompatible job families
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Single-machine batch scheduling with job processing time compatibility
cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1007/S10878-017-0139-8
description: scientific article; zbMATH DE number 6804423