Batch scheduling of nonidentical job sizes with minsum criteria
type: Item
instance of: scholarly article
title: Batch scheduling of nonidentical job sizes with minsum criteria
zbMATH Open document ID: 1481.90178
author: Rongqi Li
author: Zhiyi Tan
author: Qianyu Zhu
published in: Journal of Combinatorial Optimization
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7433401
zbMATH Keywords: scheduling
zbMATH Keywords: bin-packing
zbMATH Keywords: worst-case ratio
zbMATH Keywords: batch machine
MaRDI profile type: Publication
full work available at URL: s10878-019-00419-9
OpenAlex ID: W2946024102
cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
cites work: The optimal absolute ratio for online bin packing
cites work: On the absolute approximation ratio for first fit and related results
cites work: Scheduling a batching machine
cites work: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
cites work: A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
cites work: Q2957914
cites work: Improved bounds for batch scheduling with nonidentical job sizes
cites work: Bin packing with general cost structures
cites work: Q4198056
cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
cites work: Minimizing makespan with release times on identical parallel batching machines
cites work: ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
cites work: Scheduling with batching: A review
cites work: Q4290987
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem
Wikidata QID: Q127862464
DOI: 10.1007/S10878-019-00419-9
description: scientific article; zbMATH DE number 7433401