Batch scheduling of nonidentical job sizes with minsum criteria

DOI10.1007/S10878-019-00419-9MaRDI QIDQ2051908zbMATH OpenOpenAlexWikidataFDO

Authors Rongqi Li, Zhiyi Tan, Qianyu Zhu

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

zbMATH Keywords

schedulingbin-packingworst-case ratiobatch machine

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 563208 (Why is no real title available?)
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• Bin packing with general cost structures
• Efficient scheduling algorithms for a single batch processing machine
• Improved bounds for batch scheduling with nonidentical job sizes
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Minimizing makespan with release times on identical parallel batching machines
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• On the absolute approximation ratio for first fit and related results
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a batching machine
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling with batching: A review
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• The optimal absolute ratio for online bin packing
• Tighter bounds of the First Fit algorithm for the bin-packing problem
• Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(8)

• Improved analysis of two algorithms for min-weighted sum bin packing
• Minimizing total completion time of batch scheduling with nonidentical job sizes
• Improved bounds for batch scheduling with nonidentical job sizes
• Scheduling a batch processing machine with non-identical job sizes
• Mixed batch scheduling on identical machines
• Parallel-machine batch scheduling with non-identical job sizes
• An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
• Approximation schemes for scheduling a batching machine with nonidentical job size

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)