Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans

Jinjiang Yuan ()
Additional contact information
Jinjiang Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 9, 433-440

Abstract: Abstract We study the multi-agent scheduling on a single machine with a fixed number of competing agents, in which, the objective function of each agent is either the number of tardy jobs or the makespan, and the goal of the problem is to minimize the weighted sum of agents’ objective functions. In the literature, the computational complexity of this problem was posed as open. By using enumerating, dynamic programming, and schedule-configuration, we show in this paper that the problem is solvable in polynomial time.

Keywords: Multi-agent scheduling; Competing agents; Number of tardy jobs; Makespan (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0078-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:jcomop:v:34:y:2017:i:2:d:10.1007_s10878-016-0078-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0078-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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