Batch scheduling of nonidentical job sizes with minsum criteria
From MaRDI portal
Publication:2051908
DOI10.1007/s10878-019-00419-9zbMath1481.90178OpenAlexW2946024102WikidataQ127862464 ScholiaQ127862464MaRDI QIDQ2051908
Rongqi Li, Qianyu Zhu, Zhiyi Tan
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00419-9
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the absolute approximation ratio for first fit and related results
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Minimizing makespan with release times on identical parallel batching machines
- Scheduling with batching: A review
- Bin packing with general cost structures
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
- Improved bounds for batch scheduling with nonidentical job sizes
- The optimal absolute ratio for online bin packing
This page was built for publication: Batch scheduling of nonidentical job sizes with minsum criteria
