A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts

Goldwasser, Michael H.; Misra, Arundhati Bagchi

doi:10.1016/j.ipl.2008.03.003

Search citation statements

Order By: Relevance

Paper Sections

Select...

Optimal Competitiveness For Two Machines1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Book1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use an analysis style akin to that of [11,12]. We fix a finite instance I and an optimal schedule Opt for that instance.…”

Section: Optimal Competitiveness For Two Machinesmentioning

confidence: 99%

Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput

Bunde

Goldwasser

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We consider online, nonpreemptive scheduling of equal-length jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler's goal is to maximize the number of completed jobs (P m | rj, pj = p | P 1 − Uj). This problem has been previously studied under two distinct models. In the first, a scheduler must provide immediate notification to a released job as to whether it is accepted into the system. In a stricter model, a scheduler must provide an immediate decision for an accepted job, selecting both the time interval and machine on which it will run. We examine an intermediate model in which a scheduler immediately dispatches an accepted job to a machine, but without committing it to a specific time interval. We present a natural algorithm that is optimally competitive for m = 2. For the special case of unit-length jobs, it achieves competitive ratios for m ≥ 2 that are strictly better than lower bounds for the immediate decision model.

show abstract

“…We use an analysis style akin to that of [11,12]. We fix a finite instance I and an optimal schedule Opt for that instance.…”

Section: Optimal Competitiveness For Two Machinesmentioning

confidence: 99%