Optimal online-list batch scheduling

DOI10.1016/J.IPL.2009.07.006MaRDI QIDQ990939zbMATH OpenOpenAlexFDO

Authors Jacob Jan Paulus, Deshi Ye, Guochuan Zhang

Publication date 1 September 2010

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

Full work available at URL https://research.tue.nl/nl/publications/optimal-onlinelist-batch-scheduling(9b9482ef-4d18-400a-9027-475df9df3d40).html

zbMATH Keywords

online algorithmscompetitive analysisbatch scheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the optimality of list scheduling for online uniform machines scheduling
• Online-list scheduling on a single bounded parallel-batch machine to minimize makespan
• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
• Online scheduling on bounded parallel-batch machines
• Algorithm Theory - SWAT 2004
• Optimally competitive list batching
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
• On-line scheduling of parallel jobs in a list
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time

Cites work

• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• Algorithm Theory - SWAT 2004
• Approximation algorithms in batch processing
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Incremental medians via online bidding
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• Searching in the plane

Cited in

(5)

• On the optimality of list scheduling for online uniform machines scheduling
• Optimally competitive list batching
• Improved bounds for randomized preemptive online matching
• Algorithm Theory - SWAT 2004
• Randomized algorithms for online bounded bidding

This page was built for publication: Optimal online-list batch scheduling

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