An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines

doi:10.1007/s10951-017-0546-9

CORC > 上海财经大学 > 上海财经大学

	An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
	Gu, Manzhan 1; Gu, Jinwei 2; Lu, Xiwen 3
刊名	JOURNAL OF SCHEDULING
	2018-10
卷号	21 期号:5 页码:483-492
关键词	Scheduling Multi-agent LPT Makespan
ISSN号	1094-6136
DOI	10.1007/s10951-017-0546-9
英文摘要	This paper considers a multi-agent scheduling problem, in which each agent has a set of non-preemptive jobs, and jobs of all agents are to be processed on m identical parallel machines. The objective is to find a schedule to minimize the makespan of each agent. For an agent, the definition of a point is introduced, based on which an approximation algorithm is proposed for the problem. In the obtained schedule, the agent with the ith smallest a point value is the ith completed agent, and the agent's completion time is at most i+ times its minimummakespan. Finally, we show the performance analysis is tight.
WOS研究方向	Engineering ; Operations Research & Management Science
语种	英语
出版者	SPRINGER
WOS记录号	WOS:000444590500001
内容类型	期刊论文
源URL	[http://10.2.47.112/handle/2XS4QKH4/508]
专题	上海财经大学
通讯作者	Gu, Jinwei
作者单位	1.Shanghai Univ Finance & Econ, Sch Math, Inst Sci Computat & Financial Data Anal, Shanghai 200433, Peoples R China; 2.Shanghai Univ Elect Power, Sch Econ & Management, Shanghai 200090, Peoples R China; 3.East China Univ Sci & Technol, Sch Sci, Shanghai 200237, Peoples R China
推荐引用方式 GB/T 7714	Gu, Manzhan,Gu, Jinwei,Lu, Xiwen. An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines[J]. JOURNAL OF SCHEDULING,2018,21(5):483-492.
APA	Gu, Manzhan,Gu, Jinwei,&Lu, Xiwen.(2018).An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines.JOURNAL OF SCHEDULING,21(5),483-492.
MLA	Gu, Manzhan,et al."An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines".JOURNAL OF SCHEDULING 21.5(2018):483-492.