BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/634
DTSTAMP:20230914T125932Z
SUMMARY:Primal-Dual Algorithms in Scheduling
DESCRIPTION:Speaker: Naveen Garg (Indian Institute of Technology\, Delhi\nD
 epartment of Computer Science\nand Engineering\nHauz Khas\nNew Delhi 11001
 6)\n\nAbstract: \nAbstract: Recent years have seen application of Linear p
 rogramming techniques to solve problems in scheduling. One technique that 
 has been applied very effectively to both online and offline scheduling pr
 oblems is the Primal-Dual method. In this talk I will take two examples fr
 om our own research to illustrate some of the key ideas. The problems I wi
 ll consider are:\n- the online problem of minimizing flow time on unrelate
 d machines\n- the offline problem of minimizing weighted flow time on a si
 ngle machine.\nThe talk will assume only basic familiarity with linear pro
 gramming and duality.\n
URL:https://www.tcs.tifr.res.in/web/events/634
DTSTART;TZID=Asia/Kolkata:20151117T160000
DTEND;TZID=Asia/Kolkata:20151117T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR