Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine

DOI10.1016/J.IPL.2016.03.010MaRDI QIDQ280944zbMATH OpenOpenAlexFDO

Authors Yang Fang, Xiwen Lu

Publication date 10 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.03.010

zbMATH Keywords

analysis of algorithmsonline algorithmparallel-batch schedulingtotal weighted completion timeunbounded machine

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
• scientific article; zbMATH DE number 6490206
• Minimizing total weighted completion time on parallel unbounded batch machines

Cites work

• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
• A class of on-line scheduling algorithms to minimize total completion time
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• Approximation algorithms in batch processing
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling a batch processing system to minimize total weighted job completion time
• On-line scheduling algorithms for a batch machine with finite capacity
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling in a parallel batch processing system to minimize makespan using restarts
• Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
• Optimal on-line algorithms for one batch machine with grouped processing times
• Optimal on-line algorithms for single-machine scheduling

Cited in

(15)

• Online unbounded batch scheduling on parallel machines with delivery times
• Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
• Minimizing total weighted completion time on parallel unbounded batch machines
• An algorithm of minimizing the total weighted completed time on batch processing machine
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• On-line scheduling a batch processing system to minimize total weighted job completion time
• scientific article; zbMATH DE number 6490206 (Why is no real title available?)
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
• Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
• Online batch-machine scheduling to maximize total weight of the accepted jobs
• scientific article; zbMATH DE number 2081006 (Why is no real title available?)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time

This page was built for publication: Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280944)