Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time

zbMATH Open1299.90150MaRDI QIDQ4980804FDOQ4980804

Authors: Cheng-Wen Jiao, Wenhua Li 

Publication date: 30 June 2014

Recommendations

• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
• An optimal on-line algorithm for a parallel-batching scheduling with non-increasing processing time jobs
• Minimizing maximum flowtime of jobs with arbitrary parallelizability

zbMATH Keywords

competitive ratioon-line schedulingparallel batchingmaximum flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• An optimal on-line algorithm for a parallel-batching scheduling with non-increasing processing time jobs
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time

This page was built for publication: Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time

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