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

DOI10.1016/J.INS.2012.02.038MaRDI QIDQ712676zbMATH OpenOpenAlexFDO

Authors 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 schedulingdata allocationjob partitionminmax optimizationmultiple data-item query

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1670667
• Scheduling broadcasts in wireless networks
• scientific article; zbMATH DE number 1869809
• Publication:4952666
• scientific article; zbMATH DE number 1755613

Cites work

• scientific article; zbMATH DE number 3950398 (Why is no real title available?)
• scientific article; zbMATH DE number 1869809 (Why is no real title available?)
• An Application of Bin-Packing to Multiprocessor Scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Distributed systems. Principles and paradigms.
• Efficient data allocation over multiple channels at broadcast servers
• Generalized tardiness bounds for global multiprocessor scheduling
• Introduction to algorithms
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Scheduling with general job-dependent learning curves.
• Scheduling with general position-based learning curves
• Single-machine scheduling with learning considerations
• The flow shop with parallel machines: A tabu search approach
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Cited in

(7)

• Algebraic data retrieval algorithms for multi-channel wireless data broadcast
• Algebraic algorithm for scheduling data retrieval in multi-channel wireless data broadcast environments
• scientific article; zbMATH DE number 2086296 (Why is no real title available?)
• scientific article; zbMATH DE number 2030111 (Why is no real title available?)
• scientific article; zbMATH DE number 2172813 (Why is no real title available?)
• Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
• scientific article; zbMATH DE number 1869809 (Why is no real title available?)

This page was built for publication: Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments

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