Batch scheduling of nonidentical job sizes with minsum criteria
DOI10.1007/S10878-019-00419-9zbMATH Open1481.90178OpenAlexW2946024102WikidataQ127862464 ScholiaQ127862464MaRDI QIDQ2051908FDOQ2051908
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
Recommendations
- Minimizing total completion time of batch scheduling with nonidentical job sizes
- Improved bounds for batch scheduling with nonidentical job sizes
- Parallel-machine batch scheduling with non-identical job sizes
- Approximation schemes for scheduling a batching machine with nonidentical job size
- An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
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)
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Scheduling a batching machine
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Title not available (Why is that?)
- The optimal absolute ratio for online bin packing
- Bin packing with general cost structures
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- On the absolute approximation ratio for first fit and related results
- Minimizing makespan with release times on identical parallel batching machines
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- Improved bounds for batch scheduling with nonidentical job sizes
Cited In (4)
This page was built for publication: Batch scheduling of nonidentical job sizes with minsum criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051908)
