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

Manzhan Gu, Jinwei Gu () and Xiwen Lu
Additional contact information
Manzhan Gu: School of Mathematics, Shanghai University of Finance and Economics
Jinwei Gu: Shanghai University of Electric Power
Xiwen Lu: East China University of Science and Technology

Journal of Scheduling, 2018, vol. 21, issue 5, No 1, 483-492

Abstract: Abstract 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 $$\alpha $$ α point is introduced, based on which an approximation algorithm is proposed for the problem. In the obtained schedule, the agent with the ith smallest $$\alpha $$ α point value is the ith completed agent, and the agent’s completion time is at most $$i+ \left( \frac{1}{3}-\frac{1}{3m}\right) $$ i + 1 3 - 1 3 m times its minimum makespan. Finally, we show the performance analysis is tight.

Keywords: Scheduling; Multi-agent; LPT; Makespan (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-017-0546-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:21:y:2018:i:5:d:10.1007_s10951-017-0546-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-017-0546-9

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().