意昂4娱乐数学系学术报告

题 目：An algorithm for multi-agent scheduling to minimize makespan on two machines

报告人🤞🏽：鲁习文 教授

(华东理工大学）

【摘要】we study a multi-agent scheduling problem on two identical machines In this paper,. Each agent aims at minimizing the makespan. We present a    -approximation algorithm which produces a schedule such that the makespan of th-th completed agent is no more tha times its minimum makespan, This ratio vector is tight.

时间☂️：2014年11月5日（周三）下午15:00开始

地点🥻：数学系致远楼105教室

欢迎广大师生前来参加