Minimizing makespan with release times on identical parallel batching machines
type: Item
instance of: scholarly article
title: Minimizing makespan with release times on identical parallel batching machines
zbMATH Open document ID: 1066.90033
author: Shu-Guang Li
author: Shaoqiang Zhang
author: Guojun Li
published in: Discrete Applied Mathematics
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2165432
zbMATH Keywords: Polynomial time approximation scheme
zbMATH Keywords: Identical parallel batching machines
zbMATH Keywords: Scheduling
zbMATH Keywords: Makespan
MaRDI profile type: Publication
full work available at URL: j.dam.2004.11.004
OpenAlex ID: W2051676433
cites work: Scheduling a batching machine
cites work: A PTAS for semiconductor burn-in scheduling
cites work: Q2729097
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
DOI: 10.1016/J.DAM.2004.11.004
description: scientific article; zbMATH DE number 2165432