Dear scheduling researcher,

We are delighted to announce the talk given by Tami Tamir (Reichman Uni). The title is "Scheduling with Machine-Dependent Priority Lists". The seminar will take place on Zoom on Wednesday, June 21 at 13:00 UTC.

Join Zoom Meeting https://cesnet.zoom.us/j/93107274739?pwd=ZzI0Y0RGYmtvaXhwdG5JZDQ4dDJQUT09 Meeting ID: 931 0727 4739 Passcode: 666002

You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows. We consider a natural, yet challenging variant of the parallel machine scheduling problem in which each machine imposes a preferential order over the jobs and schedules the jobs accordingly once assigned to it. We study the setting in which a centralized authority assigns the jobs to machines, as well as the associated non-cooperative game in which jobs are controlled by selfish agents who independently choose which machine to use. In the talk, I will define the model, highlight the differences from other well-analyzed job-scheduling optimization problems and coordinated mechanisms, and present some of our results for several natural objectives (e.g., Makespan, lateness, total completion-time minimization) As we show, having machine-dependent priority lists dramatically affects both the computational complexity of the problem and the equilibrium inefficiency. Joint work with Vipin Ravindran Vijayalakshmi and Marc Schroder.

The next talk in our series will in September.

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua