A note on unbounded parallel-batch scheduling
type: Item
instance of: scholarly article
title: A note on unbounded parallel-batch scheduling
zbMATH Open document ID: 1337.90025
author: Zhichao Geng
author: Jinjiang Yuan
published in: Information Processing Letters
publication date: 2015-09-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6482182
zbMATH Keywords: analysis of algorithm
zbMATH Keywords: parallel-batch scheduling
zbMATH Keywords: maximum cost
zbMATH Keywords: strongly polynomial time
zbMATH Keywords: Pareto optimization
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.07.002
OpenAlex ID: W817947674
cites work: Scheduling a batching machine
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
cites work: BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
cites work: Multicriteria scheduling
cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Q3378953
DOI: 10.1016/J.IPL.2015.07.002
description: scientific article; zbMATH DE number 6482182