Scheduling resource allocation with timeslot penalty for changeover

Authors:
Amrinder Arora;Fanchun Jin;Hyeong-Ah Choi
Affiliations:
Department of Computer Science, The George Washington University, Washington, DC;Department of Computer Science, The George Washington University, Washington, DC;Department of Computer Science, The George Washington University, Washington, DC
Venue:
Theoretical Computer Science
Year:
2006

Citing 14
Cited 5

Scheduling parallel machines on-line

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Optimal online scheduling of parallel jobs with dependencies

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Fair scheduling in wireless packet networks

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A competitive analysis of the list update problem with lookahead

Theoretical Computer Science
Minimizing the number of tardy jobs on a single machine with batch setup times

Acta Cybernetica
A better algorithm for an ancient scheduling problem

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Better Bounds for Online Scheduling

SIAM Journal on Computing
A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Scheduling Algorithms

Scheduling Algorithms
Web caching with request reordering

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

Journal of the ACM (JACM)

New Algorithms for Online Rectangle Filling with k-Lookahead

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Online rectangle filling

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
New algorithms for online rectangle filling with k-lookahead

Journal of Combinatorial Optimization
An improved algorithm for online rectangle filling

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
An improved algorithm for online rectangle filling

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Given a time slotted list of resource capacities, we address the problem of scheduling resource allocation considering that a change in allocation results in the changeover penalty of one timeslot. The goal is to maximize the overall allocation of resources. We prove that no 1-lookahead algorithm can be better than 8/5-competitive. We provide improved analysis of Wait Dominate Hold (WDH) algorithm that was previously known to be 4-competitive. We prove that WDH is 8/3-competitive. We also consider k-lookahead algorithms, and prove lower bound of (k + 2)/(k + 1) on their competitiveness and give an online algorithm that is 2-competitive.