A flexible on-line scheduling algorithm for batch machine with infinite capacity
type: Item
instance of: scholarly article
title: A flexible on-line scheduling algorithm for batch machine with infinite capacity
zbMATH Open document ID: 1119.90021
author: Chung Keung Poon
author: Wen-Ci Yu
published in: Annals of Operations Research
publication date: 2005-04-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2160540
zbMATH Keywords: scheduling
zbMATH Keywords: batch
zbMATH Keywords: makespan
zbMATH Keywords: on-line
zbMATH Keywords: unbounded capacity
MaRDI profile type: Publication
full work available at URL: s10479-004-5031-0
OpenAlex ID: W1993201768
cites work: Scheduling a batching machine
cites work: Q2729097
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Scheduling one batch processor subject to job release dates
cites work: On-line algorithms for minimizing makespan on batch processing machines
DOI: 10.1007/S10479-004-5031-0
description: scientific article; zbMATH DE number 2160540