Seminars

View all Seminars  |  Download ICal for this event

Scheduling with cardinality dependent unavailability periods

Series: Bangalore Theory Seminars

Speaker: G. Jaykrishnan,Technion — Israel Institute of Technology

Date/Time: Jul 12 11:00:00

Location: Online Talk (See Teams link below)

Abstract:
The paper considers non-preemptive scheduling problems on parallel identical machines where machines change their status from being available to being unavailable and vice versa along the time horizon. The particular form of unavailability we consider is when the starting time of each downtime depends upon the cardinality of the job subset processed on that machine since the previous downtime. We consider the problem of minimizing the makespan in such scenarios as well as its dual problem where we have a fixed common deadline of 1 and the goal is to minimize the number of machines for which there is a feasible schedule. The talk will be about the second variant.
<br>
<br>
Microsoft teams link:
<br>
Link
<br>
We are grateful to the Kirani family for generously supporting the theory seminar series
<br>
<br>
Hosts: Rameesh Paul, KVN Sreenivas, Rahul Madhavan, Debajyoti Kar