Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments

DOI10.1016/j.ins.2012.02.038zbMath1248.68124MaRDI QIDQ712676

Jen-Ya Wang

Publication date: 17 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.038

zbMATH Keywords

broadcast scheduling; data allocation; job partition; minmax optimization; multiple data-item query

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling with general position-based learning curves
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
• Single-machine scheduling with learning considerations
• An exact algorithm for the identical parallel machine scheduling problem.
• The flow shop with parallel machines: A tabu search approach
• Scheduling with general job-dependent learning curves.
• Generalized tardiness bounds for global multiprocessor scheduling
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Bounds for Multiprocessor Scheduling with Resource Constraints
• An Application of Bin-Packing to Multiprocessor Scheduling
• Efficient data allocation over multiple channels at broadcast servers