Dynamic Interval Scheduling for Multiple Machines

About this item

Title

Dynamic Interval Scheduling for Multiple Machines

Content partner

University of Otago

Collection

Otago University Research Archive

Description

We study the dynamic scheduling problem for jobs with fixed start and end times on multiple machines. The problem is to maintain an optimal schedule under the update operations: insertions and deletions of jobs. Call the period of time in a schedule between two consecutive jobs in a given machine an idle interval. We show that for any set of jobs there exists a schedule such that the corresponding set of idle intervals forms a tree under the set-theoretic inclusion. Based on this result, we p...

Read more

Format

Research paper

Research format

Scholarly text / Conference paper

Thesis level

Conference Proceedings

Date created

2014-01-01

Creator

Gavruskin, Alexander / Khoussainov, Bakhadyr / Kokho, Mikhail / Liu, Jiamou

URL

https://hdl.handle.net/10523/39484

Related subjects

Computer Science / Computer Science, Theory & Methods / Mathematics / Physical Sciences / Science & Technology / Technology

What is the copyright status of this item?

All Rights Reserved

This item is all rights reserved, which means you'll have to get permission from University of Otago before using it.

What can I do with this item?

You must always check with University of Otago to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

No sharing

You may not copy and/or share this item with others without further permission. This includes posting it on your blog, using it in a presentation, or any other public use.

No modifying

You are not allowed to adapt or remix this item into any other works.

No commercial use

You may not use this item commercially.