Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

DOI10.1007/S10479-019-03352-6OpenAlexW2968713904MaRDI QIDQ829170FDOQ829170

Authors: Xing Chai, Wenhua Li, Yuejuan Zhu 

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03352-6

Recommendations

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

zbMATH Keywords

competitive ratioonline schedulingbatchingmaximum weighted flow-time

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Operations research and management science (90Bxx) Theory of computing (68Qxx) Mathematical programming (90Cxx)

Cites Work

• Scheduling a batching machine
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• On-line algorithms for minimizing makespan on batch processing machines
• Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
• Online over time scheduling on parallel-batch machines: a survey
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Title not available (Why is that?)
• An optimal online algorithm for single machine scheduling to minimize total general completion time
• A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• Online weighted flow time and deadline scheduling
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• A note on special optimal batching structures to minimize total weighted completion time
• Minimizing weighted flow time
• Algorithms for minimizing weighted flow time
• Makespan minimization in online scheduling with machine eligibility

Cited In (15)

• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
• Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• Title not available (Why is that?)
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
• Online Scheduling of Bounded Length Jobs to Maximize Throughput
• Online batch-machine scheduling to maximize total weight of the accepted jobs
• Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
• Title not available (Why is that?)
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

This page was built for publication: Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

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