A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Kejun Zhao, Xiwen Lu () and Manzhan Gu
Additional contact information
Kejun Zhao: East China University of Science and Technology
Xiwen Lu: East China University of Science and Technology
Manzhan Gu: Shanghai University of Finance and Economics

Journal of Scheduling, 2016, vol. 19, issue 1, No 3, 31 pages

Abstract: Abstract This paper studies a multi-agent scheduling problem on two identical parallel machines. There are g agents, and each agent’s objective is to minimize its makespan. We present an approximation algorithm such that the performance ratio of the makespan achieved by our algorithm relative to the minimum makespan is no more than $$i+\frac{1}{6}$$ i + 1 6 for the ith $$(i=1,2,\ldots ,g)$$ ( i = 1 , 2 , … , g ) completed agent. Moreover, we show that the performance ratio is tight.

Keywords: Multi-agent scheduling; Identical machines; Makespan; Approximation algorithm; Performance ratio vector (search for similar items in EconPapers)
Date: 2016
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-015-0460-y 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:19:y:2016:i:1:d:10.1007_s10951-015-0460-y

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

DOI: 10.1007/s10951-015-0460-y

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 ().