Search Results - Scheduling Multi-agent Approximation algorithm Polynomial time approximation scheme

Two-agent scheduling to minimize the total cost by Nong, Q.Q., Cheng, T.C.E., Ng, C.T.

“… ► We devise a polynomial time approximation scheme for this case. Two agents, each having his own set of jobs, compete to perform their own jobs on a common processing resource…”
Get full text

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time by Lee, Kangbok, Choi, Byung-Cheon, Leung, Joseph Y.-T., Pinedo, Michael L.

“…We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion time of his own set of jobs…”
Get full text

A two-machine no-wait flow shop problem with two competing agents by Azerine, Abdennour, Boudhar, Mourad, Rebaine, Djamal

“… We exhibited polynomial time algorithms for other restricted cases. We also proposed a mathematical programming model and a branch and bound scheme as solving approaches for small-scale problems…”
Get full text

Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs by Li, Shi-Sheng, Chen, Ren-Xia, Li, Wen-Jie

“…Different variants of the multi-agent scheduling have been studied in the literature due to its wide applications in artificial intelligence, decision theory, operations research, etc…”
Get full text

Computational complexity and approximability of social welfare optimization in multiagent resource allocation by Nguyen, Nhan-Tam, Nguyen, Trung Thanh, Roos, Magnus, Rothe, Jörg

“…A central task in multiagent resource allocation, which provides mechanisms to allocate (bundles of) resources to agents, is to maximize social welfare. We…”
Get full text